./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a93c350e5795e32421c3bef9d7525c3fd53f570f971d574def19132b3d6f08b8 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:07:53,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:07:53,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:07:53,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:07:53,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:07:53,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:07:53,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:07:53,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:07:53,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:07:53,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:07:53,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:07:53,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:07:53,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:07:53,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:07:53,858 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:07:53,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:07:53,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:07:53,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:07:53,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:07:53,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:07:53,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:07:53,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:07:53,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:07:53,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:07:53,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:07:53,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:07:53,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:07:53,863 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:07:53,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:07:53,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:07:53,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:07:53,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:07:53,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:07:53,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:07:53,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:07:53,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:07:53,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:07:53,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:07:53,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:07:53,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:07:53,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:07:53,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:07:53,867 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 -> a93c350e5795e32421c3bef9d7525c3fd53f570f971d574def19132b3d6f08b8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:07:54,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:07:54,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:07:54,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:07:54,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:07:54,075 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:07:54,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c [2024-09-11 20:07:55,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:07:55,515 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:07:55,516 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c [2024-09-11 20:07:55,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/3923ad124/3c6e9a5a31074ebba928d86c26278de2/FLAG3b68895d6 [2024-09-11 20:07:55,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/3923ad124/3c6e9a5a31074ebba928d86c26278de2 [2024-09-11 20:07:55,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:07:55,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:07:55,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:07:55,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:07:55,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:07:55,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f0a09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55, skipping insertion in model container [2024-09-11 20:07:55,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:07:55,670 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c[538,551] [2024-09-11 20:07:55,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:07:55,695 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:07:55,703 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c[538,551] [2024-09-11 20:07:55,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:07:55,725 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:07:55,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55 WrapperNode [2024-09-11 20:07:55,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:07:55,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:07:55,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:07:55,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:07:55,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,757 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-11 20:07:55,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:07:55,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:07:55,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:07:55,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:07:55,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,776 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 20:07:55,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:07:55,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:07:55,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:07:55,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:07:55,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (1/1) ... [2024-09-11 20:07:55,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:07:55,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:55,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:07:55,821 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:07:55,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:07:55,874 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 20:07:55,875 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 20:07:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:07:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:07:55,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:07:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:07:55,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:07:55,933 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:07:55,935 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:07:56,042 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 20:07:56,043 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:07:56,063 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:07:56,063 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 20:07:56,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:07:56 BoogieIcfgContainer [2024-09-11 20:07:56,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:07:56,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:07:56,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:07:56,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:07:56,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:07:55" (1/3) ... [2024-09-11 20:07:56,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e49c462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:07:56, skipping insertion in model container [2024-09-11 20:07:56,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:55" (2/3) ... [2024-09-11 20:07:56,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e49c462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:07:56, skipping insertion in model container [2024-09-11 20:07:56,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:07:56" (3/3) ... [2024-09-11 20:07:56,069 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound5.c [2024-09-11 20:07:56,080 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:07:56,081 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:07:56,116 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:07:56,122 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;@436178de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:07:56,122 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:07:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 20:07:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:07:56,130 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:56,131 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:56,131 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:56,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2024-09-11 20:07:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:56,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879031051] [2024-09-11 20:07:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,251 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,258 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,262 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:07:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879031051] [2024-09-11 20:07:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879031051] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:56,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:07:56,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:07:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377373970] [2024-09-11 20:07:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:56,273 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:07:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:07:56,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:07:56,291 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:07:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:56,320 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2024-09-11 20:07:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:07:56,323 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-11 20:07:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:56,328 INFO L225 Difference]: With dead ends: 58 [2024-09-11 20:07:56,328 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 20:07:56,331 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-11 20:07:56,335 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:56,336 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:07:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 20:07:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 20:07:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:07:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-09-11 20:07:56,366 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2024-09-11 20:07:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:56,366 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-09-11 20:07:56,367 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:07:56,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-09-11 20:07:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:07:56,368 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:56,368 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:56,368 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:07:56,369 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:56,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2024-09-11 20:07:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:56,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150617634] [2024-09-11 20:07:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,491 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,499 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:07:56,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150617634] [2024-09-11 20:07:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150617634] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:07:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:07:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535379495] [2024-09-11 20:07:56,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:56,506 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:56,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:56,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:56,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:07:56,507 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:07:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:56,571 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-09-11 20:07:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:56,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-11 20:07:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:56,572 INFO L225 Difference]: With dead ends: 41 [2024-09-11 20:07:56,572 INFO L226 Difference]: Without dead ends: 39 [2024-09-11 20:07:56,574 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:07:56,575 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:56,575 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:07:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-11 20:07:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-09-11 20:07:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:07:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-11 20:07:56,588 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2024-09-11 20:07:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:56,588 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-11 20:07:56,588 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:07:56,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-11 20:07:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:07:56,591 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:56,591 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:56,591 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:07:56,591 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:56,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2024-09-11 20:07:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:56,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200107999] [2024-09-11 20:07:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:07:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:07:56,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:56,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200107999] [2024-09-11 20:07:56,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200107999] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:56,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:07:56,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:07:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861047682] [2024-09-11 20:07:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:56,747 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:07:56,749 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:07:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:56,822 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-09-11 20:07:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:56,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-11 20:07:56,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:56,823 INFO L225 Difference]: With dead ends: 45 [2024-09-11 20:07:56,823 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 20:07:56,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:07:56,825 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:56,825 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:07:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 20:07:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-11 20:07:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:07:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-09-11 20:07:56,844 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2024-09-11 20:07:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:56,844 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-09-11 20:07:56,844 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:07:56,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-09-11 20:07:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-11 20:07:56,845 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:56,846 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:56,846 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:07:56,846 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:56,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2024-09-11 20:07:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:56,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445500571] [2024-09-11 20:07:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:56,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356766911] [2024-09-11 20:07:56,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:56,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:56,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:56,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:07:56,882 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:07:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:56,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:07:56,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:07:57,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:07:57,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445500571] [2024-09-11 20:07:57,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:07:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356766911] [2024-09-11 20:07:57,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356766911] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:57,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:07:57,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:07:57,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091581976] [2024-09-11 20:07:57,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:57,025 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:57,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:57,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:57,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:07:57,025 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:07:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:57,082 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-09-11 20:07:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:57,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-11 20:07:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:57,083 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:07:57,083 INFO L226 Difference]: Without dead ends: 49 [2024-09-11 20:07:57,084 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:07:57,085 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:57,085 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 117 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:07:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-11 20:07:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-11 20:07:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:07:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-09-11 20:07:57,095 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 33 [2024-09-11 20:07:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:57,096 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-09-11 20:07:57,096 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:07:57,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-09-11 20:07:57,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 20:07:57,097 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:57,097 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:57,116 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:07:57,301 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:57,302 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:57,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:57,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2024-09-11 20:07:57,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:57,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728711317] [2024-09-11 20:07:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:57,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927018110] [2024-09-11 20:07:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:57,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:57,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:57,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:07:57,352 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:07:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:57,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-11 20:07:57,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-11 20:07:57,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-11 20:07:57,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728711317] [2024-09-11 20:07:57,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:07:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927018110] [2024-09-11 20:07:57,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927018110] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:07:57,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:07:57,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-11 20:07:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891093910] [2024-09-11 20:07:57,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:07:57,626 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:07:57,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:57,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:07:57,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:07:57,627 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 20:07:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:57,741 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-09-11 20:07:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:07:57,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 40 [2024-09-11 20:07:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:57,744 INFO L225 Difference]: With dead ends: 64 [2024-09-11 20:07:57,745 INFO L226 Difference]: Without dead ends: 62 [2024-09-11 20:07:57,745 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:07:57,745 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:57,746 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:07:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-11 20:07:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-09-11 20:07:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-11 20:07:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2024-09-11 20:07:57,770 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 40 [2024-09-11 20:07:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:57,770 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2024-09-11 20:07:57,770 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 20:07:57,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-09-11 20:07:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:07:57,773 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:57,773 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:57,794 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:07:57,974 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:57,974 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:57,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1147651331, now seen corresponding path program 1 times [2024-09-11 20:07:57,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:57,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731466012] [2024-09-11 20:07:57,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:57,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:58,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [295763549] [2024-09-11 20:07:58,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:58,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:58,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:58,008 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-11 20:07:58,016 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-11 20:07:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 20:07:58,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-11 20:07:58,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-11 20:07:58,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731466012] [2024-09-11 20:07:58,190 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:07:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295763549] [2024-09-11 20:07:58,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295763549] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:07:58,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:07:58,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-11 20:07:58,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36171382] [2024-09-11 20:07:58,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:58,191 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:58,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:07:58,192 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 20:07:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:58,247 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-09-11 20:07:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:58,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2024-09-11 20:07:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:58,248 INFO L225 Difference]: With dead ends: 69 [2024-09-11 20:07:58,248 INFO L226 Difference]: Without dead ends: 67 [2024-09-11 20:07:58,249 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:07:58,249 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:58,250 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 110 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:07:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-11 20:07:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-09-11 20:07:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-11 20:07:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-09-11 20:07:58,272 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 50 [2024-09-11 20:07:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:58,272 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-09-11 20:07:58,272 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 20:07:58,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-09-11 20:07:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-11 20:07:58,273 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:58,273 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:58,289 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:07:58,474 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 20:07:58,475 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:58,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:58,475 INFO L85 PathProgramCache]: Analyzing trace with hash 73871321, now seen corresponding path program 1 times [2024-09-11 20:07:58,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:58,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459623409] [2024-09-11 20:07:58,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:58,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,609 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:07:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:07:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:07:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:07:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,634 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:07:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-11 20:07:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-11 20:07:58,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:58,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459623409] [2024-09-11 20:07:58,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459623409] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:58,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:07:58,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:07:58,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625928697] [2024-09-11 20:07:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:58,649 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:58,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:58,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:07:58,653 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-11 20:07:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:58,750 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2024-09-11 20:07:58,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:58,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2024-09-11 20:07:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:58,754 INFO L225 Difference]: With dead ends: 74 [2024-09-11 20:07:58,754 INFO L226 Difference]: Without dead ends: 62 [2024-09-11 20:07:58,754 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:07:58,755 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:58,755 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 127 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:07:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-11 20:07:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-09-11 20:07:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-11 20:07:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2024-09-11 20:07:58,775 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 56 [2024-09-11 20:07:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:58,775 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2024-09-11 20:07:58,776 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-11 20:07:58,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2024-09-11 20:07:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-11 20:07:58,778 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:58,778 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:58,778 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 20:07:58,778 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:58,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2024-09-11 20:07:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:58,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694512146] [2024-09-11 20:07:58,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:58,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [421332578] [2024-09-11 20:07:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:58,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:58,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:58,818 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-11 20:07:58,822 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-11 20:07:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:58,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-11 20:07:58,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-09-11 20:07:59,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-11 20:08:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:00,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694512146] [2024-09-11 20:08:00,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:08:00,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421332578] [2024-09-11 20:08:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421332578] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:08:00,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:08:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-09-11 20:08:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195222567] [2024-09-11 20:08:00,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:00,567 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 20:08:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 20:08:00,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:08:00,568 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 9 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2024-09-11 20:08:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:01,632 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2024-09-11 20:08:01,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-11 20:08:01,633 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 9 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) Word has length 70 [2024-09-11 20:08:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:01,634 INFO L225 Difference]: With dead ends: 149 [2024-09-11 20:08:01,635 INFO L226 Difference]: Without dead ends: 126 [2024-09-11 20:08:01,635 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:08:01,636 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 62 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:01,636 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 311 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-11 20:08:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-09-11 20:08:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2024-09-11 20:08:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 64 states have internal predecessors, (71), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2024-09-11 20:08:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2024-09-11 20:08:01,661 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 70 [2024-09-11 20:08:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:01,662 INFO L474 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2024-09-11 20:08:01,662 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 9 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2024-09-11 20:08:01,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2024-09-11 20:08:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-11 20:08:01,663 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:01,663 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:01,675 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:08:01,867 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:01,867 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:01,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:01,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1411586487, now seen corresponding path program 1 times [2024-09-11 20:08:01,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:01,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888862799] [2024-09-11 20:08:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:01,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:08:01,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213538167] [2024-09-11 20:08:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:01,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:01,890 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-11 20:08:01,895 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-11 20:08:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:01,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-11 20:08:01,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-09-11 20:08:02,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-11 20:08:03,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:03,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888862799] [2024-09-11 20:08:03,026 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:08:03,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213538167] [2024-09-11 20:08:03,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213538167] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:08:03,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:08:03,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-11 20:08:03,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520859649] [2024-09-11 20:08:03,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:03,027 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:08:03,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:03,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:08:03,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:08:03,028 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 11 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 9 states have call successors, (24) [2024-09-11 20:08:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:03,436 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2024-09-11 20:08:03,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:08:03,437 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 11 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 9 states have call successors, (24) Word has length 81 [2024-09-11 20:08:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:03,439 INFO L225 Difference]: With dead ends: 141 [2024-09-11 20:08:03,439 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 20:08:03,439 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:08:03,439 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:03,440 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 347 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:08:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 20:08:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2024-09-11 20:08:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-11 20:08:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2024-09-11 20:08:03,473 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 81 [2024-09-11 20:08:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:03,473 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-09-11 20:08:03,474 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 11 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 9 states have call successors, (24) [2024-09-11 20:08:03,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:03,474 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2024-09-11 20:08:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-09-11 20:08:03,479 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:03,479 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:03,500 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 20:08:03,679 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:03,680 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:03,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:03,680 INFO L85 PathProgramCache]: Analyzing trace with hash -302279341, now seen corresponding path program 2 times [2024-09-11 20:08:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813058974] [2024-09-11 20:08:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:08:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:08:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:08:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:08:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:08:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:08:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:08:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:08:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:08:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,829 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:08:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:08:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-11 20:08:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-11 20:08:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-11 20:08:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813058974] [2024-09-11 20:08:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813058974] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:08:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325248605] [2024-09-11 20:08:03,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:08:03,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:03,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:03,842 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-11 20:08:03,843 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-11 20:08:03,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:08:03,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:08:03,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:08:03,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-11 20:08:03,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-11 20:08:04,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325248605] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:08:04,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:08:04,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-09-11 20:08:04,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311367681] [2024-09-11 20:08:04,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:04,013 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:08:04,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:04,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:08:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:08:04,014 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-09-11 20:08:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:04,065 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2024-09-11 20:08:04,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 20:08:04,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 83 [2024-09-11 20:08:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:04,066 INFO L225 Difference]: With dead ends: 120 [2024-09-11 20:08:04,066 INFO L226 Difference]: Without dead ends: 98 [2024-09-11 20:08:04,066 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:08:04,067 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:04,067 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:08:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-11 20:08:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-09-11 20:08:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.152542372881356) internal successors, (68), 61 states have internal predecessors, (68), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-11 20:08:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2024-09-11 20:08:04,087 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 83 [2024-09-11 20:08:04,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:04,088 INFO L474 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2024-09-11 20:08:04,088 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-09-11 20:08:04,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2024-09-11 20:08:04,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-09-11 20:08:04,089 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:04,089 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:04,104 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 20:08:04,289 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-11 20:08:04,290 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:04,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1047816948, now seen corresponding path program 1 times [2024-09-11 20:08:04,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:04,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153192493] [2024-09-11 20:08:04,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:04,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,423 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:08:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:08:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,426 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:08:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:08:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,429 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:08:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:08:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:08:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:08:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:08:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:08:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:08:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-11 20:08:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-11 20:08:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-11 20:08:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-11 20:08:04,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:04,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153192493] [2024-09-11 20:08:04,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153192493] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:08:04,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331763458] [2024-09-11 20:08:04,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:04,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:04,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:04,456 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-11 20:08:04,457 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-11 20:08:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:04,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-11 20:08:04,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-09-11 20:08:04,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-11 20:08:05,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331763458] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:08:05,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:08:05,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 18 [2024-09-11 20:08:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307765258] [2024-09-11 20:08:05,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:05,007 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 20:08:05,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:05,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 20:08:05,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-11 20:08:05,008 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 10 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) [2024-09-11 20:08:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:05,261 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2024-09-11 20:08:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:08:05,261 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 10 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) Word has length 86 [2024-09-11 20:08:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:05,262 INFO L225 Difference]: With dead ends: 113 [2024-09-11 20:08:05,262 INFO L226 Difference]: Without dead ends: 96 [2024-09-11 20:08:05,263 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:08:05,263 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:05,263 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 373 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:08:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-11 20:08:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2024-09-11 20:08:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 56 states have internal predecessors, (62), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-11 20:08:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2024-09-11 20:08:05,281 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 86 [2024-09-11 20:08:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:05,281 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2024-09-11 20:08:05,281 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 10 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) [2024-09-11 20:08:05,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2024-09-11 20:08:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-11 20:08:05,282 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:05,282 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:05,294 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 20:08:05,483 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:05,483 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:05,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1271237959, now seen corresponding path program 1 times [2024-09-11 20:08:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218573422] [2024-09-11 20:08:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:08:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:08:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:08:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:08:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:08:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:08:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:08:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:08:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:08:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:08:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,546 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:08:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,548 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 20:08:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 20:08:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 20:08:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-11 20:08:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-11 20:08:05,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:05,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218573422] [2024-09-11 20:08:05,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218573422] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:08:05,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605762501] [2024-09-11 20:08:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:05,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:05,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:05,563 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-11 20:08:05,566 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-11 20:08:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:05,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 20:08:05,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-11 20:08:05,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:08:05,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605762501] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:08:05,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:08:05,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-09-11 20:08:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835922913] [2024-09-11 20:08:05,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:08:05,634 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:08:05,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:05,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:08:05,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:08:05,635 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-11 20:08:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:05,705 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2024-09-11 20:08:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:08:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 90 [2024-09-11 20:08:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:05,708 INFO L225 Difference]: With dead ends: 96 [2024-09-11 20:08:05,708 INFO L226 Difference]: Without dead ends: 84 [2024-09-11 20:08:05,709 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:08:05,709 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:05,709 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:08:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-11 20:08:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-09-11 20:08:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-11 20:08:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2024-09-11 20:08:05,726 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 90 [2024-09-11 20:08:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:05,726 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2024-09-11 20:08:05,726 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-11 20:08:05,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2024-09-11 20:08:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-09-11 20:08:05,727 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:05,727 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:05,740 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-11 20:08:05,927 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:05,928 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:05,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1209712204, now seen corresponding path program 3 times [2024-09-11 20:08:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:05,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363770119] [2024-09-11 20:08:05,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:05,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:08:05,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509737510] [2024-09-11 20:08:05,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:08:05,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:05,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:05,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:08:05,962 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-11 20:08:06,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-11 20:08:06,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:08:06,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-11 20:08:06,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 29 proven. 27 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-11 20:08:06,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-09-11 20:08:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363770119] [2024-09-11 20:08:23,314 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:08:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509737510] [2024-09-11 20:08:23,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509737510] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:08:23,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:08:23,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2024-09-11 20:08:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218602966] [2024-09-11 20:08:23,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:23,315 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-11 20:08:23,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:23,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-11 20:08:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:08:23,317 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) [2024-09-11 20:08:38,681 WARN L293 SmtUtils]: Spent 14.78s on a formula simplification. DAG size of input: 192 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:08:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:42,648 INFO L93 Difference]: Finished difference Result 191 states and 257 transitions. [2024-09-11 20:08:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-11 20:08:42,649 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) Word has length 100 [2024-09-11 20:08:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:42,651 INFO L225 Difference]: With dead ends: 191 [2024-09-11 20:08:42,651 INFO L226 Difference]: Without dead ends: 169 [2024-09-11 20:08:42,651 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2024-09-11 20:08:42,652 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 91 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:42,652 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 473 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-09-11 20:08:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-09-11 20:08:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 144. [2024-09-11 20:08:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 90 states have internal predecessors, (106), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-09-11 20:08:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 183 transitions. [2024-09-11 20:08:42,712 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 183 transitions. Word has length 100 [2024-09-11 20:08:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:42,712 INFO L474 AbstractCegarLoop]: Abstraction has 144 states and 183 transitions. [2024-09-11 20:08:42,712 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) [2024-09-11 20:08:42,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 183 transitions. [2024-09-11 20:08:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-09-11 20:08:42,713 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:42,713 INFO L216 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:42,725 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-11 20:08:42,914 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-11 20:08:42,914 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:42,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:42,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2000529897, now seen corresponding path program 4 times [2024-09-11 20:08:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:42,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59192037] [2024-09-11 20:08:42,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:42,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:08:42,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387870788] [2024-09-11 20:08:42,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 20:08:42,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:42,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:42,961 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:08:42,962 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-11 20:08:43,016 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 20:08:43,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:08:43,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-09-11 20:08:43,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 39 proven. 60 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-09-11 20:08:43,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 39 proven. 54 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-09-11 20:08:51,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:51,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59192037] [2024-09-11 20:08:51,885 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:08:51,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387870788] [2024-09-11 20:08:51,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387870788] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:08:51,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:08:51,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2024-09-11 20:08:51,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999636622] [2024-09-11 20:08:51,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:51,886 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-11 20:08:51,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:51,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-11 20:08:51,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2024-09-11 20:08:51,887 INFO L87 Difference]: Start difference. First operand 144 states and 183 transitions. Second operand has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 26 states have internal predecessors, (50), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 16 states have call predecessors, (34), 16 states have call successors, (34) [2024-09-11 20:09:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:09:01,516 INFO L93 Difference]: Finished difference Result 188 states and 239 transitions. [2024-09-11 20:09:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-11 20:09:01,517 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 26 states have internal predecessors, (50), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 16 states have call predecessors, (34), 16 states have call successors, (34) Word has length 105 [2024-09-11 20:09:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:09:01,518 INFO L225 Difference]: With dead ends: 188 [2024-09-11 20:09:01,518 INFO L226 Difference]: Without dead ends: 155 [2024-09-11 20:09:01,519 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=372, Invalid=1520, Unknown=0, NotChecked=0, Total=1892 [2024-09-11 20:09:01,519 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 56 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:09:01,520 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 382 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-09-11 20:09:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-09-11 20:09:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2024-09-11 20:09:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.120879120879121) internal successors, (102), 94 states have internal predecessors, (102), 37 states have call successors, (37), 18 states have call predecessors, (37), 18 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-11 20:09:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2024-09-11 20:09:01,570 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 105 [2024-09-11 20:09:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:09:01,570 INFO L474 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2024-09-11 20:09:01,571 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 26 states have internal predecessors, (50), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 16 states have call predecessors, (34), 16 states have call successors, (34) [2024-09-11 20:09:01,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2024-09-11 20:09:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-09-11 20:09:01,572 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:09:01,572 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:09:01,585 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-11 20:09:01,775 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-11 20:09:01,776 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:09:01,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 924515754, now seen corresponding path program 2 times [2024-09-11 20:09:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:09:01,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941204624] [2024-09-11 20:09:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:09:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:09:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545237515] [2024-09-11 20:09:01,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:09:01,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:09:01,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:09:01,796 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:09:01,800 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-11 20:09:01,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:09:01,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:09:01,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-11 20:09:01,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:09:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 124 proven. 22 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-09-11 20:09:02,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:09:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-11 20:09:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:09:02,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941204624] [2024-09-11 20:09:02,176 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:09:02,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545237515] [2024-09-11 20:09:02,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545237515] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:09:02,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:09:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2024-09-11 20:09:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934079398] [2024-09-11 20:09:02,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:09:02,177 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 20:09:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:09:02,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 20:09:02,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:09:02,178 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2024-09-11 20:09:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:09:03,078 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2024-09-11 20:09:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:09:03,078 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 111 [2024-09-11 20:09:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:09:03,079 INFO L225 Difference]: With dead ends: 163 [2024-09-11 20:09:03,079 INFO L226 Difference]: Without dead ends: 161 [2024-09-11 20:09:03,080 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:09:03,080 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-11 20:09:03,080 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 163 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-11 20:09:03,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-09-11 20:09:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-09-11 20:09:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.108910891089109) internal successors, (112), 105 states have internal predecessors, (112), 38 states have call successors, (38), 21 states have call predecessors, (38), 21 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-09-11 20:09:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2024-09-11 20:09:03,137 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 111 [2024-09-11 20:09:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:09:03,137 INFO L474 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2024-09-11 20:09:03,137 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2024-09-11 20:09:03,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2024-09-11 20:09:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-09-11 20:09:03,138 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:09:03,139 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:09:03,151 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-11 20:09:03,339 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-11 20:09:03,340 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:09:03,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 464728313, now seen corresponding path program 2 times [2024-09-11 20:09:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:09:03,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865510587] [2024-09-11 20:09:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:09:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:09:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:09:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:09:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:09:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:09:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,634 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:09:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:09:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:09:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:09:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:09:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:09:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 20:09:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 20:09:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 20:09:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-11 20:09:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-11 20:09:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-11 20:09:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-11 20:09:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,672 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-09-11 20:09:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-11 20:09:03,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:09:03,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865510587] [2024-09-11 20:09:03,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865510587] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:09:03,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918148970] [2024-09-11 20:09:03,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:09:03,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:09:03,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:09:03,684 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:09:03,685 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-11 20:09:03,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:09:03,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:09:03,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-11 20:09:03,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:09:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-11 20:09:04,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:09:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-11 20:09:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918148970] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:09:04,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:09:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 14] total 30 [2024-09-11 20:09:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414637173] [2024-09-11 20:09:04,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:09:04,975 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-11 20:09:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:09:04,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-11 20:09:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2024-09-11 20:09:04,976 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 27 states have internal predecessors, (61), 19 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (48), 19 states have call predecessors, (48), 19 states have call successors, (48) [2024-09-11 20:09:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:09:05,564 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2024-09-11 20:09:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:09:05,565 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 27 states have internal predecessors, (61), 19 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (48), 19 states have call predecessors, (48), 19 states have call successors, (48) Word has length 116 [2024-09-11 20:09:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:09:05,566 INFO L225 Difference]: With dead ends: 177 [2024-09-11 20:09:05,566 INFO L226 Difference]: Without dead ends: 141 [2024-09-11 20:09:05,566 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2024-09-11 20:09:05,567 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:09:05,567 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 395 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:09:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-09-11 20:09:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2024-09-11 20:09:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 28 states have call successors, (28), 18 states have call predecessors, (28), 18 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-11 20:09:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2024-09-11 20:09:05,611 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 116 [2024-09-11 20:09:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:09:05,611 INFO L474 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2024-09-11 20:09:05,611 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 27 states have internal predecessors, (61), 19 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (48), 19 states have call predecessors, (48), 19 states have call successors, (48) [2024-09-11 20:09:05,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2024-09-11 20:09:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-09-11 20:09:05,612 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:09:05,612 INFO L216 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:09:05,624 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-11 20:09:05,816 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-11 20:09:05,817 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:09:05,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:05,817 INFO L85 PathProgramCache]: Analyzing trace with hash 94041042, now seen corresponding path program 1 times [2024-09-11 20:09:05,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:09:05,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044700837] [2024-09-11 20:09:05,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:05,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:09:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:09:05,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038587299] [2024-09-11 20:09:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:05,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:09:05,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:09:05,839 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:09:05,851 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-11 20:09:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:05,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-11 20:09:05,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:09:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 33 proven. 96 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-09-11 20:09:06,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:09:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 33 proven. 90 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-09-11 20:09:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:09:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044700837] [2024-09-11 20:09:23,615 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:09:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038587299] [2024-09-11 20:09:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038587299] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:09:23,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:09:23,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 28 [2024-09-11 20:09:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645617568] [2024-09-11 20:09:23,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:09:23,616 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-11 20:09:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:09:23,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-11 20:09:23,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:09:23,617 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 25 states have internal predecessors, (54), 18 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (40), 16 states have call predecessors, (40), 18 states have call successors, (40) [2024-09-11 20:09:33,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:09:36,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:09:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:09:39,089 INFO L93 Difference]: Finished difference Result 200 states and 247 transitions. [2024-09-11 20:09:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-11 20:09:39,089 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 25 states have internal predecessors, (54), 18 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (40), 16 states have call predecessors, (40), 18 states have call successors, (40) Word has length 122 [2024-09-11 20:09:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:09:39,090 INFO L225 Difference]: With dead ends: 200 [2024-09-11 20:09:39,091 INFO L226 Difference]: Without dead ends: 172 [2024-09-11 20:09:39,091 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=364, Invalid=1528, Unknown=0, NotChecked=0, Total=1892 [2024-09-11 20:09:39,092 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 96 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-09-11 20:09:39,092 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 442 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 645 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2024-09-11 20:09:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-09-11 20:09:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2024-09-11 20:09:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 1.0980392156862746) internal successors, (112), 108 states have internal predecessors, (112), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (43), 38 states have call predecessors, (43), 43 states have call successors, (43) [2024-09-11 20:09:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2024-09-11 20:09:39,176 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 122 [2024-09-11 20:09:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:09:39,177 INFO L474 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2024-09-11 20:09:39,177 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 25 states have internal predecessors, (54), 18 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (40), 16 states have call predecessors, (40), 18 states have call successors, (40) [2024-09-11 20:09:39,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2024-09-11 20:09:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-09-11 20:09:39,178 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:09:39,178 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:09:39,190 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-09-11 20:09:39,381 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-11 20:09:39,382 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:09:39,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:39,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1038207041, now seen corresponding path program 5 times [2024-09-11 20:09:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:09:39,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071436974] [2024-09-11 20:09:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:39,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:09:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,137 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:09:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:09:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:09:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:09:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:09:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:09:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:09:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:09:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:09:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:09:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:09:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 20:09:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 20:09:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 20:09:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-11 20:09:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,242 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-11 20:09:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-11 20:09:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-11 20:09:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-11 20:09:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,263 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-09-11 20:09:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-11 20:09:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 72 proven. 21 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-09-11 20:09:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:09:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071436974] [2024-09-11 20:09:40,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071436974] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:09:40,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626102002] [2024-09-11 20:09:40,271 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 20:09:40,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:09:40,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:09:40,276 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:09:40,285 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-09-11 20:09:40,368 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-09-11 20:09:40,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:09:40,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-11 20:09:40,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:09:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 174 proven. 41 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-09-11 20:09:41,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:09:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 50 proven. 41 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2024-09-11 20:09:41,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626102002] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:09:41,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:09:41,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 32 [2024-09-11 20:09:41,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166592024] [2024-09-11 20:09:41,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:09:41,761 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-11 20:09:41,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:09:41,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-11 20:09:41,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2024-09-11 20:09:41,762 INFO L87 Difference]: Start difference. First operand 167 states and 199 transitions. Second operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 23 states have call successors, (59), 2 states have call predecessors, (59), 3 states have return successors, (60), 22 states have call predecessors, (60), 23 states have call successors, (60) [2024-09-11 20:09:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:09:42,891 INFO L93 Difference]: Finished difference Result 230 states and 288 transitions. [2024-09-11 20:09:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 20:09:42,891 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 23 states have call successors, (59), 2 states have call predecessors, (59), 3 states have return successors, (60), 22 states have call predecessors, (60), 23 states have call successors, (60) Word has length 130 [2024-09-11 20:09:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:09:42,893 INFO L225 Difference]: With dead ends: 230 [2024-09-11 20:09:42,893 INFO L226 Difference]: Without dead ends: 176 [2024-09-11 20:09:42,894 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=393, Invalid=1587, Unknown=0, NotChecked=0, Total=1980 [2024-09-11 20:09:42,898 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 113 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:09:42,899 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 397 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:09:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-09-11 20:09:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 153. [2024-09-11 20:09:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 40 states have call successors, (40), 18 states have call predecessors, (40), 18 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2024-09-11 20:09:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 181 transitions. [2024-09-11 20:09:43,040 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 181 transitions. Word has length 130 [2024-09-11 20:09:43,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:09:43,040 INFO L474 AbstractCegarLoop]: Abstraction has 153 states and 181 transitions. [2024-09-11 20:09:43,041 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 23 states have call successors, (59), 2 states have call predecessors, (59), 3 states have return successors, (60), 22 states have call predecessors, (60), 23 states have call successors, (60) [2024-09-11 20:09:43,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 181 transitions. [2024-09-11 20:09:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-09-11 20:09:43,042 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:09:43,042 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:09:43,058 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-09-11 20:09:43,244 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-11 20:09:43,245 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:09:43,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1567816513, now seen corresponding path program 2 times [2024-09-11 20:09:43,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:09:43,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325144417] [2024-09-11 20:09:43,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:43,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:09:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:09:43,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75140988] [2024-09-11 20:09:43,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:09:43,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:09:43,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:09:43,284 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:09:43,285 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-09-11 20:09:43,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:09:43,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:09:43,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-09-11 20:09:43,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:09:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 65 proven. 79 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2024-09-11 20:09:44,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 65 proven. 73 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-09-11 20:10:31,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325144417] [2024-09-11 20:10:31,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75140988] [2024-09-11 20:10:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75140988] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:31,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:10:31,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2024-09-11 20:10:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978849569] [2024-09-11 20:10:31,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:31,429 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-11 20:10:31,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-11 20:10:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2024-09-11 20:10:31,430 INFO L87 Difference]: Start difference. First operand 153 states and 181 transitions. Second operand has 32 states, 32 states have (on average 1.875) internal successors, (60), 31 states have internal predecessors, (60), 18 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (42), 16 states have call predecessors, (42), 16 states have call successors, (42) [2024-09-11 20:10:39,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:10:44,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:10:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:58,605 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2024-09-11 20:10:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-11 20:10:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 31 states have internal predecessors, (60), 18 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (42), 16 states have call predecessors, (42), 16 states have call successors, (42) Word has length 130 [2024-09-11 20:10:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:58,607 INFO L225 Difference]: With dead ends: 198 [2024-09-11 20:10:58,607 INFO L226 Difference]: Without dead ends: 196 [2024-09-11 20:10:58,608 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=493, Invalid=1858, Unknown=1, NotChecked=0, Total=2352 [2024-09-11 20:10:58,609 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 85 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:58,609 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 618 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-09-11 20:10:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-09-11 20:10:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2024-09-11 20:10:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 118 states have (on average 1.0847457627118644) internal successors, (128), 122 states have internal predecessors, (128), 42 states have call successors, (42), 25 states have call predecessors, (42), 25 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2024-09-11 20:10:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 211 transitions. [2024-09-11 20:10:58,728 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 211 transitions. Word has length 130 [2024-09-11 20:10:58,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:58,728 INFO L474 AbstractCegarLoop]: Abstraction has 186 states and 211 transitions. [2024-09-11 20:10:58,728 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 31 states have internal predecessors, (60), 18 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (42), 16 states have call predecessors, (42), 16 states have call successors, (42) [2024-09-11 20:10:58,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:58,728 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 211 transitions. [2024-09-11 20:10:58,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-09-11 20:10:58,729 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:58,729 INFO L216 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:58,742 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-09-11 20:10:58,930 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:58,930 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:58,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2086345746, now seen corresponding path program 1 times [2024-09-11 20:10:58,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:58,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703568205] [2024-09-11 20:10:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:58,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,538 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:10:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,541 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:10:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:10:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:10:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,546 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:10:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,548 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:10:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:10:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:10:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:10:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:10:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:10:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 20:10:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 20:10:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 20:10:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-11 20:10:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-11 20:10:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-11 20:10:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-11 20:10:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-11 20:10:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-09-11 20:10:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-11 20:10:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-09-11 20:10:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-09-11 20:10:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-09-11 20:10:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2024-09-11 20:10:59,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:59,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703568205] [2024-09-11 20:10:59,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703568205] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:59,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438328694] [2024-09-11 20:10:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:59,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:59,614 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:10:59,617 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-09-11 20:10:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:59,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-11 20:10:59,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 41 proven. 118 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2024-09-11 20:11:00,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 41 proven. 118 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2024-09-11 20:11:01,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438328694] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:01,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:11:01,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 15] total 40 [2024-09-11 20:11:01,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334755079] [2024-09-11 20:11:01,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:01,386 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-09-11 20:11:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:01,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-09-11 20:11:01,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2024-09-11 20:11:01,387 INFO L87 Difference]: Start difference. First operand 186 states and 211 transitions. Second operand has 40 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 26 states have call successors, (69), 3 states have call predecessors, (69), 2 states have return successors, (66), 24 states have call predecessors, (66), 26 states have call successors, (66) [2024-09-11 20:11:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:02,263 INFO L93 Difference]: Finished difference Result 201 states and 230 transitions. [2024-09-11 20:11:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 20:11:02,264 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 26 states have call successors, (69), 3 states have call predecessors, (69), 2 states have return successors, (66), 24 states have call predecessors, (66), 26 states have call successors, (66) Word has length 146 [2024-09-11 20:11:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:02,265 INFO L225 Difference]: With dead ends: 201 [2024-09-11 20:11:02,265 INFO L226 Difference]: Without dead ends: 160 [2024-09-11 20:11:02,266 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2024-09-11 20:11:02,266 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:02,266 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 585 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-11 20:11:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-09-11 20:11:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2024-09-11 20:11:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 96 states have (on average 1.0833333333333333) internal successors, (104), 98 states have internal predecessors, (104), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-11 20:11:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2024-09-11 20:11:02,356 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 146 [2024-09-11 20:11:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:02,357 INFO L474 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2024-09-11 20:11:02,357 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 26 states have call successors, (69), 3 states have call predecessors, (69), 2 states have return successors, (66), 24 states have call predecessors, (66), 26 states have call successors, (66) [2024-09-11 20:11:02,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2024-09-11 20:11:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-09-11 20:11:02,358 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:02,358 INFO L216 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:02,371 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-09-11 20:11:02,560 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:02,560 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:02,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash 476010775, now seen corresponding path program 2 times [2024-09-11 20:11:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:02,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783358254] [2024-09-11 20:11:02,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:02,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:11:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:11:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:11:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:11:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,699 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:11:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:11:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,702 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:11:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:11:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:11:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:11:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:11:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,708 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 20:11:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 20:11:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 20:11:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-11 20:11:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-11 20:11:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,715 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-11 20:11:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-09-11 20:11:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,717 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-09-11 20:11:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-09-11 20:11:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-09-11 20:11:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-09-11 20:11:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-09-11 20:11:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-09-11 20:11:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-09-11 20:11:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 74 proven. 33 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2024-09-11 20:11:02,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783358254] [2024-09-11 20:11:02,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783358254] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713421729] [2024-09-11 20:11:02,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:11:02,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:02,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:02,734 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:02,735 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-09-11 20:11:02,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:11:02,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:11:02,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:11:02,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 176 proven. 13 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2024-09-11 20:11:02,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 89 proven. 13 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2024-09-11 20:11:02,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713421729] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:02,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:11:02,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2024-09-11 20:11:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237122133] [2024-09-11 20:11:02,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:02,999 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:11:02,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:02,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:11:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:11:03,000 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 10 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 10 states have call predecessors, (35), 10 states have call successors, (35) [2024-09-11 20:11:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:03,155 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2024-09-11 20:11:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:11:03,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 10 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 10 states have call predecessors, (35), 10 states have call successors, (35) Word has length 150 [2024-09-11 20:11:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:03,158 INFO L225 Difference]: With dead ends: 170 [2024-09-11 20:11:03,158 INFO L226 Difference]: Without dead ends: 158 [2024-09-11 20:11:03,158 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 342 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:11:03,159 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:03,159 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 220 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:11:03,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-09-11 20:11:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-09-11 20:11:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 100 states have (on average 1.07) internal successors, (107), 102 states have internal predecessors, (107), 35 states have call successors, (35), 22 states have call predecessors, (35), 22 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-09-11 20:11:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2024-09-11 20:11:03,269 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 150 [2024-09-11 20:11:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:03,269 INFO L474 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2024-09-11 20:11:03,269 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 10 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 10 states have call predecessors, (35), 10 states have call successors, (35) [2024-09-11 20:11:03,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2024-09-11 20:11:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-09-11 20:11:03,270 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:03,270 INFO L216 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:03,284 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-09-11 20:11:03,471 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:03,471 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:03,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1907669179, now seen corresponding path program 3 times [2024-09-11 20:11:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:03,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348124448] [2024-09-11 20:11:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:11:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:11:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,184 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:11:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:11:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:11:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:11:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:11:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:11:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:11:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,234 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:11:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:11:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 20:11:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 20:11:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 20:11:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-11 20:11:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-11 20:11:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-11 20:11:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-09-11 20:11:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-09-11 20:11:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-09-11 20:11:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-09-11 20:11:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-09-11 20:11:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-09-11 20:11:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-09-11 20:11:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-09-11 20:11:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 83 proven. 41 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2024-09-11 20:11:04,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348124448] [2024-09-11 20:11:04,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348124448] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683528327] [2024-09-11 20:11:04,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:11:04,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:04,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:04,323 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:04,325 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-09-11 20:11:04,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-11 20:11:04,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:11:04,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 20:11:04,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 196 proven. 40 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2024-09-11 20:11:04,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 173 proven. 6 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2024-09-11 20:11:04,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683528327] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:04,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:11:04,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 8] total 29 [2024-09-11 20:11:04,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335005514] [2024-09-11 20:11:04,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:04,980 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-11 20:11:04,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:04,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-11 20:11:04,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2024-09-11 20:11:04,981 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand has 29 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (44), 4 states have call predecessors, (44), 3 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2024-09-11 20:11:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:05,527 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2024-09-11 20:11:05,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:11:05,528 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (44), 4 states have call predecessors, (44), 3 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) Word has length 152 [2024-09-11 20:11:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:05,528 INFO L225 Difference]: With dead ends: 164 [2024-09-11 20:11:05,528 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:11:05,529 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2024-09-11 20:11:05,529 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:05,529 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 374 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:11:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:11:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:11:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:11:05,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2024-09-11 20:11:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:05,530 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:11:05,530 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (44), 4 states have call predecessors, (44), 3 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2024-09-11 20:11:05,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:11:05,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:11:05,532 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:11:05,545 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-09-11 20:11:05,736 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-09-11 20:11:05,739 INFO L408 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:05,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:11:23,932 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:11:23,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:11:23 BoogieIcfgContainer [2024-09-11 20:11:23,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:11:23,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:11:23,988 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:11:23,988 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:11:23,988 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:07:56" (3/4) ... [2024-09-11 20:11:23,989 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:11:23,999 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-11 20:11:23,999 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 20:11:24,001 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-11 20:11:24,006 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:11:24,006 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:11:24,006 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:11:24,113 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:11:24,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:11:24,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:11:24,114 INFO L158 Benchmark]: Toolchain (without parser) took 208579.94ms. Allocated memory was 176.2MB in the beginning and 885.0MB in the end (delta: 708.8MB). Free memory was 108.7MB in the beginning and 450.7MB in the end (delta: -342.0MB). Peak memory consumption was 368.8MB. Max. memory is 16.1GB. [2024-09-11 20:11:24,114 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory was 134.1MB in the beginning and 133.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:11:24,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.32ms. Allocated memory is still 176.2MB. Free memory was 108.5MB in the beginning and 96.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:11:24,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.04ms. Allocated memory is still 176.2MB. Free memory was 96.5MB in the beginning and 94.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:11:24,115 INFO L158 Benchmark]: Boogie Preprocessor took 32.50ms. Allocated memory is still 176.2MB. Free memory was 94.9MB in the beginning and 93.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:11:24,115 INFO L158 Benchmark]: RCFGBuilder took 269.95ms. Allocated memory is still 176.2MB. Free memory was 93.1MB in the beginning and 138.4MB in the end (delta: -45.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-09-11 20:11:24,116 INFO L158 Benchmark]: TraceAbstraction took 207921.98ms. Allocated memory was 176.2MB in the beginning and 885.0MB in the end (delta: 708.8MB). Free memory was 137.7MB in the beginning and 455.9MB in the end (delta: -318.2MB). Peak memory consumption was 529.3MB. Max. memory is 16.1GB. [2024-09-11 20:11:24,116 INFO L158 Benchmark]: Witness Printer took 126.31ms. Allocated memory is still 885.0MB. Free memory was 455.9MB in the beginning and 450.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:11:24,118 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory was 134.1MB in the beginning and 133.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.32ms. Allocated memory is still 176.2MB. Free memory was 108.5MB in the beginning and 96.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.04ms. Allocated memory is still 176.2MB. Free memory was 96.5MB in the beginning and 94.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.50ms. Allocated memory is still 176.2MB. Free memory was 94.9MB in the beginning and 93.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 269.95ms. Allocated memory is still 176.2MB. Free memory was 93.1MB in the beginning and 138.4MB in the end (delta: -45.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * TraceAbstraction took 207921.98ms. Allocated memory was 176.2MB in the beginning and 885.0MB in the end (delta: 708.8MB). Free memory was 137.7MB in the beginning and 455.9MB in the end (delta: -318.2MB). Peak memory consumption was 529.3MB. Max. memory is 16.1GB. * Witness Printer took 126.31ms. Allocated memory is still 885.0MB. Free memory was 455.9MB in the beginning and 450.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 189.6s, OverallIterations: 22, TraceHistogramMax: 23, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 78.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 754 SdHoareTripleChecker+Valid, 22.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 684 mSDsluCounter, 6083 SdHoareTripleChecker+Invalid, 21.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5255 mSDsCounter, 1032 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5638 IncrementalHoareTripleChecker+Invalid, 6671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1032 mSolverCounterUnsat, 828 mSDtfsCounter, 5638 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4012 GetRequests, 3540 SyntacticMatches, 16 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3330 ImplicationChecksByTransitivity, 72.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=19, InterpolantAutomatonStates: 289, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 159 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 105.0s InterpolantComputationTime, 3720 NumberOfCodeBlocks, 3636 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 4504 ConstructedInterpolants, 1 QuantifiedInterpolants, 68422 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3738 ConjunctsInSsa, 475 ConjunctsInUnsatCore, 46 InterpolantComputations, 7 PerfectInterpolantSequences, 20055/21372 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((p == 1) && (0 <= r)) && ((A % 4294967296) == (r + ((long long) 4 * (B % 4294967296))))) && (q == 4)) && (((((__int128) -1 * r) + (A % 4294967296)) / 4) == d)) && (((__int128) r + 1) <= d)) && (A <= (((A / 4294967296) * 4294967296) + 5))) || ((((((2 == p) && (((long long) 2 * (B % 4294967296)) == d)) && (q == 0)) && (r == (A % 4294967296))) && (((__int128) r + 1) <= d)) && ((d / 2) <= r))) || (((((((p == 1) && (d == (B % 4294967296))) && (0 <= r)) && (3 == q)) && (((__int128) r + 1) <= ((d / 2) + d))) && ((((long long) 2 * (B % 4294967296)) + d) <= 5)) && (((d / 2) + (A % 4294967296)) == (r + ((long long) 3 * (B % 4294967296)))))) || (((((((2 == p) && ((A % 4294967296) <= 5)) && (2 == q)) && ((d + r) == (A % 4294967296))) && ((A % 4294967296) == (((long long) 2 * (B % 4294967296)) + r))) && (((long long) 2 * (B % 4294967296)) <= (d + r))) && (((__int128) r + 1) <= d))) || ((((p == 1) && (q == 0)) && ((((B / 4294967296) * 4294967296) + d) == B)) && (r == (A % 4294967296)))) || ((((((((A % 4294967296) == ((__int128) r + 4)) && (2 == p)) && (0 <= r)) && (q == 4)) && (B == (((B / 4294967296) * 4294967296) + 1))) && (2 == d)) && (A <= (((A / 4294967296) * 4294967296) + 5)))) || ((((((((p == 4) && ((A % 4294967296) <= 5)) && (q == 0)) && (r == (A % 4294967296))) && (((__int128) r + 1) <= d)) && ((d % 2) == 0)) && ((d / 2) <= r)) && (((d / 2) + (A % 4294967296)) == (((long long) 2 * (B % 4294967296)) + r)))) || (((((((p == 4) && ((A % 4294967296) == ((__int128) r + 4))) && (0 <= r)) && (q == 4)) && (d == 4)) && (B == (((B / 4294967296) * 4294967296) + 1))) && (A <= (((A / 4294967296) * 4294967296) + 5)))) || (((((((r + (B % 4294967296)) == (A % 4294967296)) && (p == 1)) && (0 <= r)) && (q == 1)) && ((d + (A % 4294967296)) == (((long long) 2 * (B % 4294967296)) + r))) && (((__int128) r + 1) <= d))) || ((((((((p == 1) && ((d / 2) == 0)) && ((r + ((long long) 5 * (B % 4294967296))) == (A % 4294967296))) && (0 <= r)) && (r < d)) && (5 == q)) && (((long long) (A % 4294967296) + 1) <= ((long long) 8 * (B % 4294967296)))) && (A <= (((A / 4294967296) * 4294967296) + 5)))) || (((((((p == 1) && (0 <= r)) && (((__int128) r + 1) <= ((d / 2) + d))) && (2 == q)) && ((((long long) 2 * (B % 4294967296)) + r) <= 5)) && ((A % 4294967296) == (((long long) 2 * (B % 4294967296)) + r))) && (((((__int128) -1 * r) + (A % 4294967296)) / 2) == d))) || (((((((p == 8) && (q == 0)) && ((r + ((long long) 8 * (B % 4294967296))) == (d + (A % 4294967296)))) && (d == ((long long) 8 * (B % 4294967296)))) && (((__int128) r + 1) <= d)) && (A <= (((A / 4294967296) * 4294967296) + 5))) && ((d / 2) <= r))) - InvariantResult [Line: 61]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((2 == p) && (((long long) 2 * (B % 4294967296)) == d)) && (1 <= (d / 2))) && (q == 0)) && (r == (A % 4294967296))) && (A <= (((A / 4294967296) * 4294967296) + 5))) && ((d / 2) <= r)) || ((((((((p == 4) && (1 <= (d / 2))) && (q == 0)) && (r == (A % 4294967296))) && (A <= (((A / 4294967296) * 4294967296) + 5))) && ((d % 2) == 0)) && ((d / 2) <= r)) && (((d / 2) + (A % 4294967296)) == (((long long) 2 * (B % 4294967296)) + r)))) || (((((((p == 8) && (1 <= (d / 2))) && (q == 0)) && ((r + ((long long) 8 * (B % 4294967296))) == (d + (A % 4294967296)))) && (d == ((long long) 8 * (B % 4294967296)))) && (A <= (((A / 4294967296) * 4294967296) + 5))) && ((d / 2) <= r))) || ((((((p == 1) && (q == 0)) && ((((B / 4294967296) * 4294967296) + d) == B)) && (1 <= d)) && (r == (A % 4294967296))) && (A <= (((A / 4294967296) * 4294967296) + 5)))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:11:24,328 WARN L435 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-09-11 20:11:24,363 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE