./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.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 e1972ee33272415a52c6f0d8a1f799e9d488ad771872c0cf36a214b07ea597fd --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:31:44,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:31:44,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:31:44,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:31:44,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:31:44,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:31:44,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:31:44,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:31:44,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:31:44,910 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:31:44,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:31:44,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:31:44,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:31:44,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:31:44,912 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:31:44,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:31:44,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:31:44,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:31:44,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:31:44,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:31:44,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:31:44,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:31:44,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:31:44,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:31:44,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:31:44,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:31:44,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:31:44,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:31:44,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:31:44,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:31:44,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:31:44,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:31:44,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:31:44,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:31:44,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:31:44,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:31:44,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:31:44,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:31:44,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:31:44,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:31:44,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:31:44,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:31:44,923 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 -> e1972ee33272415a52c6f0d8a1f799e9d488ad771872c0cf36a214b07ea597fd Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:31:45,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:31:45,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:31:45,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:31:45,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:31:45,292 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:31:45,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c [2024-09-25 10:31:46,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:31:47,023 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:31:47,024 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c [2024-09-25 10:31:47,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/955791e7f/063b46a7c81941109a743945b8a67c38/FLAGc2765667a [2024-09-25 10:31:47,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/955791e7f/063b46a7c81941109a743945b8a67c38 [2024-09-25 10:31:47,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:31:47,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:31:47,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:31:47,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:31:47,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:31:47,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dce926f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47, skipping insertion in model container [2024-09-25 10:31:47,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:31:47,600 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c[318,331] [2024-09-25 10:31:47,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:31:47,630 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:31:47,641 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c[318,331] [2024-09-25 10:31:47,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:31:47,659 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:31:47,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47 WrapperNode [2024-09-25 10:31:47,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:31:47,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:31:47,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:31:47,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:31:47,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,681 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:31:47,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:31:47,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:31:47,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:31:47,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:31:47,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,703 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:31:47,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:31:47,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:31:47,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:31:47,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:31:47,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (1/1) ... [2024-09-25 10:31:47,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:31:47,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:47,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:31:47,755 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:31:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:31:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:31:47,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:31:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:31:47,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:31:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:31:47,796 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:31:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:31:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:31:47,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:31:47,863 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:31:47,865 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:31:48,003 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-25 10:31:48,004 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:31:48,031 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:31:48,032 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:31:48,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:31:48 BoogieIcfgContainer [2024-09-25 10:31:48,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:31:48,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:31:48,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:31:48,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:31:48,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:31:47" (1/3) ... [2024-09-25 10:31:48,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1b2645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:31:48, skipping insertion in model container [2024-09-25 10:31:48,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:47" (2/3) ... [2024-09-25 10:31:48,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1b2645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:31:48, skipping insertion in model container [2024-09-25 10:31:48,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:31:48" (3/3) ... [2024-09-25 10:31:48,051 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_8.c [2024-09-25 10:31:48,067 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:31:48,067 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:31:48,132 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:31:48,141 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;@2af8d5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:31:48,141 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:31:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:31:48,152 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:48,152 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:48,154 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:48,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1710538099, now seen corresponding path program 1 times [2024-09-25 10:31:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:48,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630246204] [2024-09-25 10:31:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:48,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:48,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630246204] [2024-09-25 10:31:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630246204] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:48,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:31:48,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926945669] [2024-09-25 10:31:48,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:48,294 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:31:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:31:48,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:31:48,316 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:48,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:48,340 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-09-25 10:31:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:31:48,343 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 10:31:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:48,348 INFO L225 Difference]: With dead ends: 30 [2024-09-25 10:31:48,348 INFO L226 Difference]: Without dead ends: 13 [2024-09-25 10:31:48,351 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:31:48,356 INFO L434 NwaCegarLoop]: 18 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, 18 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:48,356 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-25 10:31:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-25 10:31:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-09-25 10:31:48,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2024-09-25 10:31:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:48,392 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-09-25 10:31:48,392 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:48,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-09-25 10:31:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:31:48,394 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:48,394 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:48,394 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:31:48,395 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:48,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1720696830, now seen corresponding path program 1 times [2024-09-25 10:31:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204785094] [2024-09-25 10:31:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:48,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:48,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:48,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204785094] [2024-09-25 10:31:48,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204785094] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:48,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:48,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:31:48,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696851973] [2024-09-25 10:31:48,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:48,663 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:31:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:48,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:31:48,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:48,664 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:48,703 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-09-25 10:31:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:31:48,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 10:31:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:48,706 INFO L225 Difference]: With dead ends: 24 [2024-09-25 10:31:48,706 INFO L226 Difference]: Without dead ends: 16 [2024-09-25 10:31:48,706 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:48,708 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:48,710 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-25 10:31:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-09-25 10:31:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-09-25 10:31:48,719 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-09-25 10:31:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:48,719 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-09-25 10:31:48,720 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:48,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-09-25 10:31:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 10:31:48,722 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:48,722 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:48,722 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:31:48,723 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:48,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1696808404, now seen corresponding path program 1 times [2024-09-25 10:31:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:48,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232303277] [2024-09-25 10:31:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:48,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:48,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:49,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232303277] [2024-09-25 10:31:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232303277] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:49,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800988432] [2024-09-25 10:31:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:49,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:49,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:49,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:49,004 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:31:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:49,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 10:31:49,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:49,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800988432] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:49,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:49,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2024-09-25 10:31:49,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415018120] [2024-09-25 10:31:49,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:49,231 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:31:49,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:49,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:31:49,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:31:49,232 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:49,319 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-09-25 10:31:49,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:31:49,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-25 10:31:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:49,322 INFO L225 Difference]: With dead ends: 31 [2024-09-25 10:31:49,322 INFO L226 Difference]: Without dead ends: 23 [2024-09-25 10:31:49,323 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:31:49,324 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:49,326 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 23 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-25 10:31:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-25 10:31:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-09-25 10:31:49,337 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 13 [2024-09-25 10:31:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:49,338 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-09-25 10:31:49,339 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:49,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-09-25 10:31:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:31:49,341 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:49,341 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:49,358 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 10:31:49,541 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:49,542 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:49,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:49,542 INFO L85 PathProgramCache]: Analyzing trace with hash 177718978, now seen corresponding path program 1 times [2024-09-25 10:31:49,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:49,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716545573] [2024-09-25 10:31:49,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:49,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:49,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:31:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:49,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716545573] [2024-09-25 10:31:49,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716545573] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:49,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872127734] [2024-09-25 10:31:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:49,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:49,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:49,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:49,678 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:31:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:49,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:31:49,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:49,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:49,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872127734] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:49,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:49,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-09-25 10:31:49,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684235166] [2024-09-25 10:31:49,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:49,842 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:31:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:49,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:31:49,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:31:49,844 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:49,995 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-09-25 10:31:49,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:31:49,997 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-25 10:31:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:49,999 INFO L225 Difference]: With dead ends: 47 [2024-09-25 10:31:49,999 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 10:31:49,999 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:31:50,002 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:50,002 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 37 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 10:31:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-09-25 10:31:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-09-25 10:31:50,018 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2024-09-25 10:31:50,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:50,018 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-09-25 10:31:50,019 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:50,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-09-25 10:31:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:31:50,023 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:50,023 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:50,040 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:31:50,224 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:50,224 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:50,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:50,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1559699330, now seen corresponding path program 2 times [2024-09-25 10:31:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:50,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584121735] [2024-09-25 10:31:50,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:50,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:50,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:50,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:50,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584121735] [2024-09-25 10:31:50,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584121735] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:50,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776854485] [2024-09-25 10:31:50,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:31:50,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:50,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:50,470 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:50,474 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:31:50,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:31:50,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:50,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 10:31:50,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:50,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:50,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776854485] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:50,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:50,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2024-09-25 10:31:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979314723] [2024-09-25 10:31:50,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:50,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 10:31:50,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:50,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 10:31:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:31:50,825 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:51,183 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-09-25 10:31:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 10:31:51,184 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-25 10:31:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:51,185 INFO L225 Difference]: With dead ends: 46 [2024-09-25 10:31:51,185 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 10:31:51,185 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:31:51,186 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:51,186 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 72 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 10:31:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-25 10:31:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2024-09-25 10:31:51,199 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2024-09-25 10:31:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:51,200 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2024-09-25 10:31:51,200 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:51,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2024-09-25 10:31:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 10:31:51,201 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:51,202 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:51,218 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:31:51,402 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:51,403 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:51,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash -254018046, now seen corresponding path program 2 times [2024-09-25 10:31:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:51,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041964322] [2024-09-25 10:31:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:51,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:51,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 43 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:31:51,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:51,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041964322] [2024-09-25 10:31:51,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041964322] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:51,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580524253] [2024-09-25 10:31:51,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:31:51,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:51,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:51,630 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:51,631 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:31:51,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:31:51,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:51,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 10:31:51,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 43 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:31:51,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 43 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:31:51,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580524253] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:51,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:51,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-09-25 10:31:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051173141] [2024-09-25 10:31:51,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:51,989 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 10:31:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:51,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 10:31:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:31:51,991 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:53,168 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2024-09-25 10:31:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 10:31:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-09-25 10:31:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:53,170 INFO L225 Difference]: With dead ends: 77 [2024-09-25 10:31:53,170 INFO L226 Difference]: Without dead ends: 67 [2024-09-25 10:31:53,171 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=306, Invalid=506, Unknown=0, NotChecked=0, Total=812 [2024-09-25 10:31:53,171 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:53,172 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 79 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:31:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-25 10:31:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-09-25 10:31:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2024-09-25 10:31:53,198 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 40 [2024-09-25 10:31:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:53,198 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2024-09-25 10:31:53,198 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:53,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2024-09-25 10:31:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 10:31:53,200 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:53,201 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:53,219 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:31:53,401 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:53,401 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:53,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:53,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1127962306, now seen corresponding path program 3 times [2024-09-25 10:31:53,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:53,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069462454] [2024-09-25 10:31:53,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:53,785 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:53,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069462454] [2024-09-25 10:31:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069462454] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776902600] [2024-09-25 10:31:53,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:31:53,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:53,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:53,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:53,796 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:31:53,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-25 10:31:53,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:53,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:31:53,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-09-25 10:31:53,986 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:31:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776902600] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:53,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:31:53,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-09-25 10:31:53,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806556990] [2024-09-25 10:31:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:53,988 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:31:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:53,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:31:53,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:31:53,990 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:54,064 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2024-09-25 10:31:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:31:54,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-09-25 10:31:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:54,066 INFO L225 Difference]: With dead ends: 76 [2024-09-25 10:31:54,066 INFO L226 Difference]: Without dead ends: 71 [2024-09-25 10:31:54,066 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:31:54,067 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:54,067 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 22 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-25 10:31:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-09-25 10:31:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2024-09-25 10:31:54,095 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 40 [2024-09-25 10:31:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:54,097 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2024-09-25 10:31:54,097 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:54,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2024-09-25 10:31:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-25 10:31:54,099 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:54,099 INFO L216 NwaCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:54,118 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-25 10:31:54,304 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:31:54,305 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:54,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash -653386262, now seen corresponding path program 3 times [2024-09-25 10:31:54,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:54,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318194767] [2024-09-25 10:31:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:54,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:54,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 37 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318194767] [2024-09-25 10:31:54,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318194767] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:54,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111075261] [2024-09-25 10:31:54,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:31:54,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:54,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:54,825 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:31:54,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 10:31:54,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:54,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:31:54,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-09-25 10:31:55,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-09-25 10:31:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111075261] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:55,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:55,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 8] total 32 [2024-09-25 10:31:55,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892585827] [2024-09-25 10:31:55,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:55,636 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-25 10:31:55,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:55,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-25 10:31:55,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2024-09-25 10:31:55,637 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 32 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:56,688 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2024-09-25 10:31:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-25 10:31:56,691 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2024-09-25 10:31:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:56,692 INFO L225 Difference]: With dead ends: 97 [2024-09-25 10:31:56,692 INFO L226 Difference]: Without dead ends: 87 [2024-09-25 10:31:56,693 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=557, Invalid=2413, Unknown=0, NotChecked=0, Total=2970 [2024-09-25 10:31:56,694 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 62 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:56,697 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 43 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:31:56,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-25 10:31:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-09-25 10:31:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-09-25 10:31:56,728 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 67 [2024-09-25 10:31:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:56,728 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-09-25 10:31:56,728 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:56,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-09-25 10:31:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-25 10:31:56,730 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:56,730 INFO L216 NwaCegarLoop]: trace histogram [25, 25, 20, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:56,747 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 10:31:56,931 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:56,931 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:56,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:56,932 INFO L85 PathProgramCache]: Analyzing trace with hash 982073386, now seen corresponding path program 4 times [2024-09-25 10:31:56,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:56,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613292909] [2024-09-25 10:31:56,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:56,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:57,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 289 proven. 610 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 10:31:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613292909] [2024-09-25 10:31:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613292909] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899208989] [2024-09-25 10:31:57,495 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:31:57,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:57,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:57,497 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:57,499 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:31:57,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:31:57,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:57,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-25 10:31:57,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 238 proven. 672 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:31:57,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 238 proven. 672 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:31:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899208989] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:58,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:58,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 47 [2024-09-25 10:31:58,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340260612] [2024-09-25 10:31:58,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:58,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-09-25 10:31:58,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-09-25 10:31:58,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=1544, Unknown=0, NotChecked=0, Total=2162 [2024-09-25 10:31:58,549 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 47 states, 47 states have (on average 3.0425531914893615) internal successors, (143), 47 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:32:59,761 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2024-09-25 10:32:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-09-25 10:32:59,762 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.0425531914893615) internal successors, (143), 47 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-09-25 10:32:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:32:59,764 INFO L225 Difference]: With dead ends: 180 [2024-09-25 10:32:59,764 INFO L226 Difference]: Without dead ends: 158 [2024-09-25 10:32:59,767 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 61.5s TimeCoverageRelationStatistics Valid=1605, Invalid=2951, Unknown=0, NotChecked=0, Total=4556 [2024-09-25 10:32:59,768 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:32:59,768 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 164 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:32:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-09-25 10:32:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-09-25 10:32:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2024-09-25 10:32:59,799 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 85 [2024-09-25 10:32:59,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:32:59,799 INFO L474 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2024-09-25 10:32:59,800 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.0425531914893615) internal successors, (143), 47 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:59,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2024-09-25 10:32:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-09-25 10:32:59,802 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:32:59,802 INFO L216 NwaCegarLoop]: trace histogram [49, 49, 44, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:32:59,819 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 10:33:00,003 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:00,003 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:00,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:00,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2006408406, now seen corresponding path program 5 times [2024-09-25 10:33:00,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:00,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508408330] [2024-09-25 10:33:00,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:00,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:01,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 625 proven. 2926 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 10:33:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:01,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508408330] [2024-09-25 10:33:01,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508408330] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:01,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629334359] [2024-09-25 10:33:01,811 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:33:01,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:01,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:01,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:33:01,813 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:33:02,370 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2024-09-25 10:33:02,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:33:02,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-09-25 10:33:02,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 625 proven. 2926 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 10:33:02,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:33:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 625 proven. 2926 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 10:33:06,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629334359] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:33:06,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:33:06,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 48] total 94 [2024-09-25 10:33:06,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858826089] [2024-09-25 10:33:06,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:33:06,387 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-09-25 10:33:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-09-25 10:33:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2347, Invalid=6395, Unknown=0, NotChecked=0, Total=8742 [2024-09-25 10:33:06,390 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand has 94 states, 94 states have (on average 2.9893617021276597) internal successors, (281), 94 states have internal predecessors, (281), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:33:33,016 WARN L293 SmtUtils]: Spent 14.64s on a formula simplification. DAG size of input: 271 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:33:58,092 WARN L293 SmtUtils]: Spent 13.72s on a formula simplification. DAG size of input: 265 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:34:31,866 WARN L293 SmtUtils]: Spent 16.83s on a formula simplification. DAG size of input: 259 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:35:03,107 WARN L293 SmtUtils]: Spent 10.37s on a formula simplification. DAG size of input: 253 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:35:40,544 WARN L293 SmtUtils]: Spent 14.64s on a formula simplification. DAG size of input: 247 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:36:21,081 WARN L293 SmtUtils]: Spent 11.39s on a formula simplification. DAG size of input: 241 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)