./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.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 9851f41ad4fb2d0ff96507e8e48f0d2886a8de6481eed845b23377b9fa492b45 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-17 19:00:55,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 19:00:55,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 19:00:55,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 19:00:55,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 19:00:55,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 19:00:55,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 19:00:55,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 19:00:55,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 19:00:55,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 19:00:55,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 19:00:55,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 19:00:55,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 19:00:55,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 19:00:55,281 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 19:00:55,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 19:00:55,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 19:00:55,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 19:00:55,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 19:00:55,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 19:00:55,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 19:00:55,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 19:00:55,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 19:00:55,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 19:00:55,284 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 19:00:55,284 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 19:00:55,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 19:00:55,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 19:00:55,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 19:00:55,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 19:00:55,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 19:00:55,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 19:00:55,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:00:55,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 19:00:55,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 19:00:55,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 19:00:55,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 19:00:55,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 19:00:55,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 19:00:55,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 19:00:55,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 19:00:55,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 19:00:55,288 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 -> 9851f41ad4fb2d0ff96507e8e48f0d2886a8de6481eed845b23377b9fa492b45 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-17 19:00:55,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 19:00:55,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 19:00:55,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 19:00:55,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 19:00:55,528 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 19:00:55,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-17 19:00:56,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 19:00:56,854 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 19:00:56,854 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-17 19:00:56,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/f9cadc2be/1bfc7fcca44449ed8cdfce370b2829ad/FLAG497e15880 [2024-09-17 19:00:57,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/f9cadc2be/1bfc7fcca44449ed8cdfce370b2829ad [2024-09-17 19:00:57,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 19:00:57,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 19:00:57,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 19:00:57,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 19:00:57,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 19:00:57,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16111985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57, skipping insertion in model container [2024-09-17 19:00:57,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 19:00:57,390 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/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2024-09-17 19:00:57,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:00:57,409 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 19:00:57,418 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/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2024-09-17 19:00:57,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:00:57,435 INFO L204 MainTranslator]: Completed translation [2024-09-17 19:00:57,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57 WrapperNode [2024-09-17 19:00:57,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 19:00:57,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 19:00:57,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 19:00:57,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 19:00:57,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,455 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 19:00:57,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 19:00:57,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 19:00:57,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 19:00:57,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 19:00:57,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,486 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-17 19:00:57,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 19:00:57,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 19:00:57,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 19:00:57,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 19:00:57,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (1/1) ... [2024-09-17 19:00:57,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:00:57,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:00:57,527 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-17 19:00:57,534 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-17 19:00:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 19:00:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-17 19:00:57,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-17 19:00:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 19:00:57,564 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 19:00:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 19:00:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 19:00:57,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 19:00:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 19:00:57,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 19:00:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 19:00:57,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 19:00:57,612 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 19:00:57,613 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 19:00:57,735 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-17 19:00:57,735 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 19:00:57,749 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 19:00:57,749 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-17 19:00:57,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:00:57 BoogieIcfgContainer [2024-09-17 19:00:57,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 19:00:57,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 19:00:57,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 19:00:57,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 19:00:57,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 07:00:57" (1/3) ... [2024-09-17 19:00:57,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ddf883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:00:57, skipping insertion in model container [2024-09-17 19:00:57,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:00:57" (2/3) ... [2024-09-17 19:00:57,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ddf883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:00:57, skipping insertion in model container [2024-09-17 19:00:57,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:00:57" (3/3) ... [2024-09-17 19:00:57,758 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound2.c [2024-09-17 19:00:57,771 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 19:00:57,771 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 19:00:57,856 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 19:00:57,863 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;@5a9371c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 19:00:57,864 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 19:00:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-17 19:00:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-17 19:00:57,901 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:00:57,901 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:00:57,902 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:00:57,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-17 19:00:57,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:00:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643112631] [2024-09-17 19:00:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:00:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:00:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:00:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:00:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:00:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-17 19:00:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 19:00:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:00:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643112631] [2024-09-17 19:00:58,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643112631] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:00:58,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:00:58,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-17 19:00:58,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457169286] [2024-09-17 19:00:58,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:00:58,066 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-17 19:00:58,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:00:58,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-17 19:00:58,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-17 19:00:58,083 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-17 19:00:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:00:58,105 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-17 19:00:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-17 19:00:58,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-17 19:00:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:00:58,111 INFO L225 Difference]: With dead ends: 66 [2024-09-17 19:00:58,112 INFO L226 Difference]: Without dead ends: 32 [2024-09-17 19:00:58,115 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-17 19:00:58,119 INFO L434 NwaCegarLoop]: 44 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, 44 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-17 19:00:58,119 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:00:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-17 19:00:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-17 19:00:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-17 19:00:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-17 19:00:58,145 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-17 19:00:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:00:58,146 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-17 19:00:58,146 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-17 19:00:58,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-17 19:00:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-17 19:00:58,147 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:00:58,148 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:00:58,148 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 19:00:58,148 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:00:58,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-17 19:00:58,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:00:58,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664443784] [2024-09-17 19:00:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:00:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:00:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:00:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:00:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:00:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-17 19:00:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 19:00:58,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:00:58,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664443784] [2024-09-17 19:00:58,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664443784] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:00:58,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:00:58,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 19:00:58,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816759490] [2024-09-17 19:00:58,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:00:58,336 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:00:58,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:00:58,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:00:58,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:00:58,340 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-17 19:00:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:00:58,387 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-17 19:00:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:00:58,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-17 19:00:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:00:58,389 INFO L225 Difference]: With dead ends: 45 [2024-09-17 19:00:58,389 INFO L226 Difference]: Without dead ends: 43 [2024-09-17 19:00:58,389 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-17 19:00:58,390 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 19:00:58,390 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:00:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-17 19:00:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-17 19:00:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-17 19:00:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-17 19:00:58,402 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-17 19:00:58,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:00:58,402 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-17 19:00:58,403 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-17 19:00:58,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-17 19:00:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-17 19:00:58,405 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:00:58,405 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:00:58,405 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-17 19:00:58,405 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:00:58,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-17 19:00:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:00:58,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831028753] [2024-09-17 19:00:58,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:00:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:00:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:00:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:00:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:00:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-17 19:00:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-17 19:00:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 19:00:58,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:00:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831028753] [2024-09-17 19:00:58,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831028753] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:00:58,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:00:58,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 19:00:58,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107184705] [2024-09-17 19:00:58,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:00:58,540 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:00:58,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:00:58,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:00:58,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:00:58,541 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-17 19:00:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:00:58,591 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-17 19:00:58,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:00:58,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-17 19:00:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:00:58,592 INFO L225 Difference]: With dead ends: 49 [2024-09-17 19:00:58,592 INFO L226 Difference]: Without dead ends: 47 [2024-09-17 19:00:58,593 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-17 19:00:58,594 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 19:00:58,594 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:00:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-17 19:00:58,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-17 19:00:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-17 19:00:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-17 19:00:58,606 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-17 19:00:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:00:58,607 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-17 19:00:58,607 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-17 19:00:58,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-17 19:00:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-17 19:00:58,608 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:00:58,608 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:00:58,608 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-17 19:00:58,608 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:00:58,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-17 19:00:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:00:58,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040821420] [2024-09-17 19:00:58,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:00:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:00:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 19:00:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84969284] [2024-09-17 19:00:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:00:58,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:00:58,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:00:58,641 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-17 19:00:58,642 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-17 19:00:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:58,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-17 19:00:58,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:00:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-17 19:00:58,775 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 19:00:58,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:00:58,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040821420] [2024-09-17 19:00:58,775 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 19:00:58,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84969284] [2024-09-17 19:00:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84969284] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:00:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:00:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 19:00:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27072656] [2024-09-17 19:00:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:00:58,779 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:00:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:00:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:00:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:00:58,779 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-17 19:00:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:00:58,843 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-17 19:00:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:00:58,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-09-17 19:00:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:00:58,846 INFO L225 Difference]: With dead ends: 66 [2024-09-17 19:00:58,847 INFO L226 Difference]: Without dead ends: 53 [2024-09-17 19:00:58,848 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-17 19:00:58,848 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 19:00:58,849 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:00:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-17 19:00:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-17 19:00:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-17 19:00:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-17 19:00:58,864 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-17 19:00:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:00:58,864 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-17 19:00:58,864 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-17 19:00:58,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-17 19:00:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-17 19:00:58,865 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:00:58,865 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:00:58,880 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-17 19:00:59,065 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:00:59,066 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:00:59,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:59,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-17 19:00:59,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:00:59,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727223108] [2024-09-17 19:00:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:00:59,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:00:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 19:00:59,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733333651] [2024-09-17 19:00:59,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:00:59,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:00:59,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:00:59,098 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-17 19:00:59,099 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-17 19:00:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:59,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-17 19:00:59,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:00:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-17 19:00:59,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:00:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-17 19:00:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:00:59,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727223108] [2024-09-17 19:00:59,427 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 19:00:59,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733333651] [2024-09-17 19:00:59,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733333651] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:00:59,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 19:00:59,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-17 19:00:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911531059] [2024-09-17 19:00:59,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 19:00:59,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-17 19:00:59,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:00:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-17 19:00:59,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-17 19:00:59,428 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-17 19:00:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:00:59,506 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-09-17 19:00:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 19:00:59,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-09-17 19:00:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:00:59,508 INFO L225 Difference]: With dead ends: 68 [2024-09-17 19:00:59,508 INFO L226 Difference]: Without dead ends: 66 [2024-09-17 19:00:59,508 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-17 19:00:59,509 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:00:59,509 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:00:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-17 19:00:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-09-17 19:00:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-17 19:00:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-09-17 19:00:59,522 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 44 [2024-09-17 19:00:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:00:59,523 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-09-17 19:00:59,523 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-17 19:00:59,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-09-17 19:00:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-17 19:00:59,524 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:00:59,524 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:00:59,537 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-17 19:00:59,728 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:00:59,729 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:00:59,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:00:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-17 19:00:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:00:59,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648277122] [2024-09-17 19:00:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:00:59,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:00:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 19:00:59,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947009006] [2024-09-17 19:00:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:00:59,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:00:59,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:00:59,750 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-17 19:00:59,751 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-17 19:00:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:00:59,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-17 19:00:59,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:00:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-17 19:00:59,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:00:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-17 19:00:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:00:59,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648277122] [2024-09-17 19:00:59,965 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 19:00:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947009006] [2024-09-17 19:00:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947009006] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-17 19:00:59,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-17 19:00:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-17 19:00:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519763855] [2024-09-17 19:00:59,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:00:59,966 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:00:59,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:00:59,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:00:59,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-17 19:00:59,967 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-17 19:01:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:00,025 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-09-17 19:01:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:01:00,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-09-17 19:01:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:00,028 INFO L225 Difference]: With dead ends: 73 [2024-09-17 19:01:00,028 INFO L226 Difference]: Without dead ends: 71 [2024-09-17 19:01:00,029 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-17 19:01:00,029 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:00,029 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:01:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-17 19:01:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-17 19:01:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-17 19:01:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-09-17 19:01:00,051 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2024-09-17 19:01:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:00,051 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-09-17 19:01:00,051 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-17 19:01:00,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-09-17 19:01:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-17 19:01:00,053 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:01:00,053 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:00,070 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-17 19:01:00,253 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-17 19:01:00,254 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:01:00,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash 515743006, now seen corresponding path program 1 times [2024-09-17 19:01:00,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:01:00,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143177183] [2024-09-17 19:01:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:01:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:01:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:01:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:01:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,367 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-17 19:01:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-17 19:01:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 19:01:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 19:01:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-17 19:01:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-17 19:01:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-17 19:01:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-17 19:01:00,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:01:00,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143177183] [2024-09-17 19:01:00,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143177183] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:01:00,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:01:00,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 19:01:00,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371780293] [2024-09-17 19:01:00,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:01:00,407 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:01:00,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:01:00,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:01:00,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:01:00,407 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-17 19:01:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:00,461 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-09-17 19:01:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:01:00,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2024-09-17 19:01:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:00,462 INFO L225 Difference]: With dead ends: 78 [2024-09-17 19:01:00,463 INFO L226 Difference]: Without dead ends: 66 [2024-09-17 19:01:00,463 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-17 19:01:00,463 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:00,465 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:01:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-17 19:01:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-17 19:01:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-17 19:01:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-09-17 19:01:00,481 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2024-09-17 19:01:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:00,481 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-09-17 19:01:00,482 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-17 19:01:00,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-09-17 19:01:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-17 19:01:00,485 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:01:00,485 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:00,486 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-17 19:01:00,486 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:01:00,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-17 19:01:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:01:00,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503224266] [2024-09-17 19:01:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:01:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 19:01:00,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109916202] [2024-09-17 19:01:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:00,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:01:00,518 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-17 19:01:00,519 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-17 19:01:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:00,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-17 19:01:00,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:01:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-09-17 19:01:01,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:01:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-17 19:01:02,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:01:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503224266] [2024-09-17 19:01:02,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 19:01:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109916202] [2024-09-17 19:01:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109916202] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:01:02,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 19:01:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-17 19:01:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562794631] [2024-09-17 19:01:02,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 19:01:02,462 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-17 19:01:02,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:01:02,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-17 19:01:02,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-09-17 19:01:02,463 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 9 states have call predecessors, (23), 8 states have call successors, (23) [2024-09-17 19:01:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:03,478 INFO L93 Difference]: Finished difference Result 152 states and 208 transitions. [2024-09-17 19:01:03,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-17 19:01:03,478 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 9 states have call predecessors, (23), 8 states have call successors, (23) Word has length 74 [2024-09-17 19:01:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:03,481 INFO L225 Difference]: With dead ends: 152 [2024-09-17 19:01:03,483 INFO L226 Difference]: Without dead ends: 129 [2024-09-17 19:01:03,483 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2024-09-17 19:01:03,484 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 73 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:03,484 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 308 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-17 19:01:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-09-17 19:01:03,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2024-09-17 19:01:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-09-17 19:01:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2024-09-17 19:01:03,514 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 74 [2024-09-17 19:01:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:03,514 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2024-09-17 19:01:03,514 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 9 states have call predecessors, (23), 8 states have call successors, (23) [2024-09-17 19:01:03,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2024-09-17 19:01:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-17 19:01:03,518 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:01:03,518 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:03,533 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-17 19:01:03,722 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:03,722 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:01:03,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-09-17 19:01:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:01:03,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021390359] [2024-09-17 19:01:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:01:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 19:01:03,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402002341] [2024-09-17 19:01:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:03,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:03,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:01:03,742 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-17 19:01:03,743 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-17 19:01:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:03,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-17 19:01:03,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:01:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-09-17 19:01:04,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:01:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-17 19:01:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:01:04,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021390359] [2024-09-17 19:01:04,629 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 19:01:04,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402002341] [2024-09-17 19:01:04,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402002341] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:01:04,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 19:01:04,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-17 19:01:04,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805487510] [2024-09-17 19:01:04,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 19:01:04,630 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-17 19:01:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:01:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-17 19:01:04,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-09-17 19:01:04,631 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-17 19:01:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:05,024 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2024-09-17 19:01:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-17 19:01:05,025 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) Word has length 85 [2024-09-17 19:01:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:05,026 INFO L225 Difference]: With dead ends: 145 [2024-09-17 19:01:05,026 INFO L226 Difference]: Without dead ends: 111 [2024-09-17 19:01:05,026 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2024-09-17 19:01:05,027 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 26 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:05,027 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 350 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:01:05,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-17 19:01:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-09-17 19:01:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 59 states have internal predecessors, (66), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-17 19:01:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-09-17 19:01:05,059 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 85 [2024-09-17 19:01:05,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:05,059 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-09-17 19:01:05,059 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-17 19:01:05,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-09-17 19:01:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-17 19:01:05,062 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:01:05,062 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:05,074 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-17 19:01:05,266 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:05,267 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:01:05,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:05,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1973508941, now seen corresponding path program 2 times [2024-09-17 19:01:05,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:01:05,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529807556] [2024-09-17 19:01:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:05,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:01:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:01:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:01:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:01:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-17 19:01:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-17 19:01:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 19:01:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 19:01:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-17 19:01:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-17 19:01:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,411 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-17 19:01:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,413 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-17 19:01:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,416 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-17 19:01:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-17 19:01:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-17 19:01:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-17 19:01:05,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:01:05,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529807556] [2024-09-17 19:01:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529807556] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:01:05,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677106705] [2024-09-17 19:01:05,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-17 19:01:05,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:05,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:01:05,426 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-17 19:01:05,426 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-17 19:01:05,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-17 19:01:05,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 19:01:05,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-17 19:01:05,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:01:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-17 19:01:05,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:01:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-17 19:01:05,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677106705] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:01:05,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:01:05,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-09-17 19:01:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150285075] [2024-09-17 19:01:05,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:01:05,558 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:01:05,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:01:05,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:01:05,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:01:05,559 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-09-17 19:01:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:05,609 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2024-09-17 19:01:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:01:05,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 87 [2024-09-17 19:01:05,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:05,611 INFO L225 Difference]: With dead ends: 124 [2024-09-17 19:01:05,611 INFO L226 Difference]: Without dead ends: 102 [2024-09-17 19:01:05,611 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:01:05,612 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:05,612 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:01:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-17 19:01:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-09-17 19:01:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-17 19:01:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-09-17 19:01:05,633 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 87 [2024-09-17 19:01:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:05,634 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-09-17 19:01:05,634 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-09-17 19:01:05,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-09-17 19:01:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-17 19:01:05,635 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:01:05,635 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:05,647 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-17 19:01:05,835 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-17 19:01:05,835 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:01:05,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash -637517709, now seen corresponding path program 1 times [2024-09-17 19:01:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:01:05,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150075903] [2024-09-17 19:01:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:05,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:01:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:01:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:01:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:01:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-17 19:01:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-17 19:01:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 19:01:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 19:01:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,023 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-17 19:01:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-17 19:01:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-17 19:01:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-17 19:01:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-17 19:01:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-17 19:01:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-17 19:01:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-17 19:01:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-17 19:01:06,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:01:06,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150075903] [2024-09-17 19:01:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150075903] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:01:06,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233155217] [2024-09-17 19:01:06,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:06,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:06,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:01:06,056 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-17 19:01:06,057 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-17 19:01:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:06,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-17 19:01:06,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:01:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-09-17 19:01:06,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:01:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-17 19:01:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233155217] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:01:06,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:01:06,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 18 [2024-09-17 19:01:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665128862] [2024-09-17 19:01:06,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:01:06,611 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-17 19:01:06,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:01:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-17 19:01:06,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-17 19:01:06,612 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-17 19:01:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:06,908 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2024-09-17 19:01:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-17 19:01:06,909 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) Word has length 90 [2024-09-17 19:01:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:06,910 INFO L225 Difference]: With dead ends: 117 [2024-09-17 19:01:06,910 INFO L226 Difference]: Without dead ends: 100 [2024-09-17 19:01:06,910 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-09-17 19:01:06,911 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:06,911 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 389 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:01:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-17 19:01:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-09-17 19:01:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-17 19:01:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-09-17 19:01:06,931 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 90 [2024-09-17 19:01:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:06,931 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-09-17 19:01:06,931 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-17 19:01:06,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-09-17 19:01:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-17 19:01:06,932 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:01:06,932 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:06,944 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-17 19:01:07,132 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:07,133 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:01:07,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:07,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1204328542, now seen corresponding path program 1 times [2024-09-17 19:01:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:01:07,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792400599] [2024-09-17 19:01:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:01:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:01:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:01:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:01:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-17 19:01:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-17 19:01:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 19:01:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,206 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 19:01:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-17 19:01:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-17 19:01:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-17 19:01:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-17 19:01:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-17 19:01:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-17 19:01:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-17 19:01:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-17 19:01:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-17 19:01:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-17 19:01:07,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:01:07,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792400599] [2024-09-17 19:01:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792400599] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:01:07,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476056630] [2024-09-17 19:01:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:07,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:07,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:01:07,227 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-17 19:01:07,228 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-17 19:01:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-17 19:01:07,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:01:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-17 19:01:07,295 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 19:01:07,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476056630] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:01:07,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-17 19:01:07,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-09-17 19:01:07,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469758636] [2024-09-17 19:01:07,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:01:07,296 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:01:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:01:07,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:01:07,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-17 19:01:07,297 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-17 19:01:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:07,346 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-09-17 19:01:07,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:01:07,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 94 [2024-09-17 19:01:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:07,347 INFO L225 Difference]: With dead ends: 100 [2024-09-17 19:01:07,347 INFO L226 Difference]: Without dead ends: 88 [2024-09-17 19:01:07,347 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-17 19:01:07,348 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:07,348 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 120 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:01:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-17 19:01:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-17 19:01:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-17 19:01:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2024-09-17 19:01:07,365 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 94 [2024-09-17 19:01:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:07,366 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2024-09-17 19:01:07,366 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-17 19:01:07,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2024-09-17 19:01:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-09-17 19:01:07,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:01:07,367 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:07,379 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-17 19:01:07,567 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:07,568 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:01:07,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash -588826413, now seen corresponding path program 3 times [2024-09-17 19:01:07,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:01:07,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921940557] [2024-09-17 19:01:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:07,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:01:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,930 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:01:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:01:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:01:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-17 19:01:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-17 19:01:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 19:01:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 19:01:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:07,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-17 19:01:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:08,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-17 19:01:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:08,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-17 19:01:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:08,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-17 19:01:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:08,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-17 19:01:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:08,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-17 19:01:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:08,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-17 19:01:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:08,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-17 19:01:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:08,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-17 19:01:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:08,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-17 19:01:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-17 19:01:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:01:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921940557] [2024-09-17 19:01:08,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921940557] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:01:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776869526] [2024-09-17 19:01:08,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-17 19:01:08,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:08,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:01:08,083 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:01:08,086 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-17 19:01:08,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-17 19:01:08,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 19:01:08,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-17 19:01:08,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:01:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-17 19:01:08,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:01:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-17 19:01:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776869526] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:01:09,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:01:09,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-09-17 19:01:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611911743] [2024-09-17 19:01:09,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:01:09,028 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-17 19:01:09,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:01:09,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-17 19:01:09,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-09-17 19:01:09,029 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 23 states have internal predecessors, (57), 16 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) [2024-09-17 19:01:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:09,502 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2024-09-17 19:01:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-17 19:01:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 23 states have internal predecessors, (57), 16 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) Word has length 104 [2024-09-17 19:01:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:09,503 INFO L225 Difference]: With dead ends: 153 [2024-09-17 19:01:09,504 INFO L226 Difference]: Without dead ends: 101 [2024-09-17 19:01:09,504 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2024-09-17 19:01:09,504 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 50 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:09,505 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 502 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:01:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-17 19:01:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2024-09-17 19:01:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-17 19:01:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2024-09-17 19:01:09,525 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 104 [2024-09-17 19:01:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:09,526 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2024-09-17 19:01:09,526 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 23 states have internal predecessors, (57), 16 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) [2024-09-17 19:01:09,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2024-09-17 19:01:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-17 19:01:09,527 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:01:09,527 INFO L216 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:09,532 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-17 19:01:09,727 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-17 19:01:09,728 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:01:09,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1394769075, now seen corresponding path program 1 times [2024-09-17 19:01:09,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:01:09,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270300991] [2024-09-17 19:01:09,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:09,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:01:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 19:01:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747922166] [2024-09-17 19:01:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:09,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:09,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:01:09,756 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:01:09,757 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-17 19:01:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:09,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-17 19:01:09,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:01:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-09-17 19:01:10,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:01:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-09-17 19:01:11,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:01:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270300991] [2024-09-17 19:01:11,913 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 19:01:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747922166] [2024-09-17 19:01:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747922166] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:01:11,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 19:01:11,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 29 [2024-09-17 19:01:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663547155] [2024-09-17 19:01:11,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 19:01:11,914 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-17 19:01:11,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:01:11,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-17 19:01:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-09-17 19:01:11,914 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 16 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35) [2024-09-17 19:01:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:12,550 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2024-09-17 19:01:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-17 19:01:12,551 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 16 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35) Word has length 109 [2024-09-17 19:01:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:12,551 INFO L225 Difference]: With dead ends: 117 [2024-09-17 19:01:12,551 INFO L226 Difference]: Without dead ends: 95 [2024-09-17 19:01:12,552 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2024-09-17 19:01:12,552 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:12,552 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 473 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 19:01:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-17 19:01:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-09-17 19:01:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-17 19:01:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-09-17 19:01:12,571 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 109 [2024-09-17 19:01:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:12,572 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-09-17 19:01:12,572 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 16 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35) [2024-09-17 19:01:12,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-09-17 19:01:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-17 19:01:12,573 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:01:12,573 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:12,584 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-17 19:01:12,776 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-17 19:01:12,776 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:01:12,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:12,777 INFO L85 PathProgramCache]: Analyzing trace with hash 733497000, now seen corresponding path program 1 times [2024-09-17 19:01:12,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:01:12,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786768109] [2024-09-17 19:01:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:01:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 19:01:12,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338971137] [2024-09-17 19:01:12,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:12,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:12,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:01:12,801 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:01:12,802 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-17 19:01:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:12,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-17 19:01:12,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:01:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 64 proven. 72 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-09-17 19:01:13,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:01:14,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:01:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786768109] [2024-09-17 19:01:14,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 19:01:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338971137] [2024-09-17 19:01:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338971137] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:01:14,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-17 19:01:14,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-09-17 19:01:14,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040751674] [2024-09-17 19:01:14,517 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-17 19:01:14,517 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-17 19:01:14,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:01:14,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-17 19:01:14,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-09-17 19:01:14,518 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2024-09-17 19:01:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:14,856 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-09-17 19:01:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-17 19:01:14,856 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) Word has length 115 [2024-09-17 19:01:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:14,857 INFO L225 Difference]: With dead ends: 101 [2024-09-17 19:01:14,857 INFO L226 Difference]: Without dead ends: 97 [2024-09-17 19:01:14,857 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2024-09-17 19:01:14,859 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:14,860 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 405 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:01:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-17 19:01:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-09-17 19:01:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.0) internal successors, (60), 60 states have internal predecessors, (60), 22 states have call successors, (22), 16 states have call predecessors, (22), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-17 19:01:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-09-17 19:01:14,881 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 115 [2024-09-17 19:01:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:14,883 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-09-17 19:01:14,883 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2024-09-17 19:01:14,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-09-17 19:01:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-09-17 19:01:14,884 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:01:14,885 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:14,897 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-17 19:01:15,086 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-17 19:01:15,086 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:01:15,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash 265983484, now seen corresponding path program 1 times [2024-09-17 19:01:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:01:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579431567] [2024-09-17 19:01:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:01:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:01:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,353 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:01:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:01:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-17 19:01:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-17 19:01:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 19:01:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 19:01:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-17 19:01:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-17 19:01:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-17 19:01:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-17 19:01:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-17 19:01:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-17 19:01:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-17 19:01:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-17 19:01:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-17 19:01:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-17 19:01:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-17 19:01:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-17 19:01:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-17 19:01:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-17 19:01:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:01:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579431567] [2024-09-17 19:01:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579431567] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:01:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956035452] [2024-09-17 19:01:15,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:01:15,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:01:15,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:01:15,407 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:01:15,408 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-17 19:01:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:01:15,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-17 19:01:15,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:01:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 31 proven. 74 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-17 19:01:15,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:01:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 31 proven. 74 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-17 19:01:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956035452] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:01:16,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:01:16,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 26 [2024-09-17 19:01:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034402902] [2024-09-17 19:01:16,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:01:16,402 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-17 19:01:16,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:01:16,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-17 19:01:16,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-09-17 19:01:16,403 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 17 states have call predecessors, (49), 19 states have call successors, (49) [2024-09-17 19:01:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:01:16,726 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-09-17 19:01:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-17 19:01:16,727 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 17 states have call predecessors, (49), 19 states have call successors, (49) Word has length 120 [2024-09-17 19:01:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:01:16,727 INFO L225 Difference]: With dead ends: 97 [2024-09-17 19:01:16,727 INFO L226 Difference]: Without dead ends: 0 [2024-09-17 19:01:16,728 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2024-09-17 19:01:16,728 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:01:16,729 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 354 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:01:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-17 19:01:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-17 19:01:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-17 19:01:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-17 19:01:16,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-09-17 19:01:16,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:01:16,729 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-17 19:01:16,729 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 17 states have call predecessors, (49), 19 states have call successors, (49) [2024-09-17 19:01:16,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:01:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-17 19:01:16,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-17 19:01:16,732 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-17 19:01:16,744 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-17 19:01:16,933 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-17 19:01:16,935 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:01:16,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-17 19:01:18,386 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-17 19:01:18,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.09 07:01:18 BoogieIcfgContainer [2024-09-17 19:01:18,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-17 19:01:18,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-17 19:01:18,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-17 19:01:18,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-17 19:01:18,411 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:00:57" (3/4) ... [2024-09-17 19:01:18,413 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-17 19:01:18,450 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-17 19:01:18,451 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-17 19:01:18,451 INFO L158 Benchmark]: Toolchain (without parser) took 21186.06ms. Allocated memory was 188.7MB in the beginning and 427.8MB in the end (delta: 239.1MB). Free memory was 121.4MB in the beginning and 292.3MB in the end (delta: -170.9MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2024-09-17 19:01:18,452 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 19:01:18,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.62ms. Allocated memory is still 188.7MB. Free memory was 121.4MB in the beginning and 109.5MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-17 19:01:18,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.48ms. Allocated memory is still 188.7MB. Free memory was 109.5MB in the beginning and 108.6MB in the end (delta: 928.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 19:01:18,452 INFO L158 Benchmark]: Boogie Preprocessor took 41.49ms. Allocated memory is still 188.7MB. Free memory was 108.6MB in the beginning and 106.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 19:01:18,453 INFO L158 Benchmark]: RCFGBuilder took 251.61ms. Allocated memory is still 188.7MB. Free memory was 106.8MB in the beginning and 92.3MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-17 19:01:18,453 INFO L158 Benchmark]: TraceAbstraction took 20656.21ms. Allocated memory was 188.7MB in the beginning and 427.8MB in the end (delta: 239.1MB). Free memory was 91.8MB in the beginning and 294.4MB in the end (delta: -202.6MB). Peak memory consumption was 192.3MB. Max. memory is 16.1GB. [2024-09-17 19:01:18,453 INFO L158 Benchmark]: Witness Printer took 42.92ms. Allocated memory is still 427.8MB. Free memory was 294.4MB in the beginning and 292.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 19:01:18,455 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.62ms. Allocated memory is still 188.7MB. Free memory was 121.4MB in the beginning and 109.5MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.48ms. Allocated memory is still 188.7MB. Free memory was 109.5MB in the beginning and 108.6MB in the end (delta: 928.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.49ms. Allocated memory is still 188.7MB. Free memory was 108.6MB in the beginning and 106.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 251.61ms. Allocated memory is still 188.7MB. Free memory was 106.8MB in the beginning and 92.3MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20656.21ms. Allocated memory was 188.7MB in the beginning and 427.8MB in the end (delta: 239.1MB). Free memory was 91.8MB in the beginning and 294.4MB in the end (delta: -202.6MB). Peak memory consumption was 192.3MB. Max. memory is 16.1GB. * Witness Printer took 42.92ms. Allocated memory is still 427.8MB. Free memory was 294.4MB in the beginning and 292.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 16, TraceHistogramMax: 17, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 3912 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3270 mSDsCounter, 326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2541 IncrementalHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 326 mSolverCounterUnsat, 642 mSDtfsCounter, 2541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2120 GetRequests, 1884 SyntacticMatches, 6 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=8, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 75 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 2172 NumberOfCodeBlocks, 2145 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2391 ConstructedInterpolants, 0 QuantifiedInterpolants, 15679 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2175 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 6714/7295 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((0 <= r) && (((__int128) r + 1) <= d)) && (((__int128) d + r) == A)) && (((__int128) r + (2 * B)) == ((__int128) A + d))) && (q == 1)) && (A <= 2)) && (p == 1)) || ((((((B == 1) && (r == 0)) && (q == 2)) && (p == 2)) && (A == 2)) && (d == 2))) || (((((((A == r) && (d == (2 * B))) && (((__int128) r + 1) <= d)) && (p == 2)) && (q == 0)) && (A <= 2)) && (B <= r))) || ((((((B == 1) && (r == 0)) && (q == 2)) && (A == 2)) && (d == 1)) && (p == 1))) || ((((d == B) && (A == r)) && (q == 0)) && (p == 1))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((__int128) A + d) == ((__int128) (B * 4) + r))) && (q == 0)) && (p == 4)) && ((A + (d / 2)) == ((__int128) r + (2 * B)))) && (1 <= d)) && (A <= 2))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((d == B) && (A == r)) && (q == 0)) && (1 <= d)) && (A <= 2)) && (p == 1)) || (((((((A == r) && (d == (2 * B))) && (p == 2)) && (q == 0)) && (1 <= d)) && (A <= 2)) && (B <= r))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((__int128) A + d) == ((__int128) (B * 4) + r))) && (q == 0)) && (p == 4)) && ((A + (d / 2)) == ((__int128) r + (2 * B)))) && (1 <= d)) && (A <= 2))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-17 19:01:18,511 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE