./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.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 4e2993d4b0d2c145cb6ebddb0d9f125eb6995ee629adf15e0b0f7e55a8d8a49a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:43:12,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:43:12,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:43:12,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:43:12,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:43:12,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:43:12,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:43:12,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:43:12,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:43:12,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:43:12,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:43:12,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:43:12,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:43:12,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:43:12,784 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:43:12,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:43:12,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:43:12,785 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:43:12,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:43:12,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:43:12,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:43:12,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:43:12,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:43:12,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:43:12,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:43:12,790 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:43:12,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:43:12,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:43:12,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:43:12,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:43:12,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:43:12,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:43:12,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:43:12,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:43:12,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:43:12,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:43:12,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:43:12,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:43:12,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:43:12,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:43:12,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:43:12,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:43:12,796 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 -> 4e2993d4b0d2c145cb6ebddb0d9f125eb6995ee629adf15e0b0f7e55a8d8a49a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:43:13,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:43:13,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:43:13,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:43:13,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:43:13,067 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:43:13,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c [2024-09-25 10:43:14,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:43:14,547 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:43:14,548 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c [2024-09-25 10:43:14,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/55c245be7/b947f1ea2c99416894692f0f79a37959/FLAG35f71019c [2024-09-25 10:43:14,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/55c245be7/b947f1ea2c99416894692f0f79a37959 [2024-09-25 10:43:14,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:43:14,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:43:14,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:43:14,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:43:14,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:43:14,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:43:14" (1/1) ... [2024-09-25 10:43:14,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5198b6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:14, skipping insertion in model container [2024-09-25 10:43:14,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:43:14" (1/1) ... [2024-09-25 10:43:14,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:43:15,059 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/cohencu-ll_valuebound10.c[588,601] [2024-09-25 10:43:15,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:43:15,080 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:43:15,087 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/cohencu-ll_valuebound10.c[588,601] [2024-09-25 10:43:15,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:43:15,105 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:43:15,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15 WrapperNode [2024-09-25 10:43:15,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:43:15,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:43:15,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:43:15,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:43:15,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,129 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:43:15,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:43:15,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:43:15,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:43:15,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:43:15,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,150 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:43:15,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:43:15,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:43:15,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:43:15,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:43:15,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (1/1) ... [2024-09-25 10:43:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:43:15,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:15,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:43:15,205 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:43:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:43:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:43:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:43:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:43:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:43:15,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:43:15,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:43:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:43:15,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:43:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:43:15,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:43:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:43:15,290 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:43:15,293 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:43:15,441 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:43:15,441 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:43:15,456 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:43:15,456 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:43:15,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:43:15 BoogieIcfgContainer [2024-09-25 10:43:15,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:43:15,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:43:15,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:43:15,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:43:15,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:43:14" (1/3) ... [2024-09-25 10:43:15,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38217ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:43:15, skipping insertion in model container [2024-09-25 10:43:15,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:15" (2/3) ... [2024-09-25 10:43:15,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38217ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:43:15, skipping insertion in model container [2024-09-25 10:43:15,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:43:15" (3/3) ... [2024-09-25 10:43:15,462 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound10.c [2024-09-25 10:43:15,474 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:43:15,475 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:43:15,511 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:43:15,516 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;@7f363263, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:43:15,516 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:43:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-25 10:43:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:43:15,524 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:15,524 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:15,525 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:15,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1802650881, now seen corresponding path program 1 times [2024-09-25 10:43:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:15,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238725000] [2024-09-25 10:43:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:15,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:15,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:43:15,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:15,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238725000] [2024-09-25 10:43:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238725000] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:15,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:15,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:43:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412762735] [2024-09-25 10:43:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:15,651 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:43:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:15,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:43:15,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:43:15,670 INFO L87 Difference]: Start difference. First operand has 34 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:15,692 INFO L93 Difference]: Finished difference Result 60 states and 98 transitions. [2024-09-25 10:43:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:43:15,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 10:43:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:15,702 INFO L225 Difference]: With dead ends: 60 [2024-09-25 10:43:15,702 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 10:43:15,704 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:43:15,708 INFO L434 NwaCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:15,709 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 10:43:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-25 10:43:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:43:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2024-09-25 10:43:15,747 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 16 [2024-09-25 10:43:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:15,748 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2024-09-25 10:43:15,749 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:15,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-09-25 10:43:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:43:15,750 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:15,750 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:15,751 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:43:15,752 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:15,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1133972673, now seen corresponding path program 1 times [2024-09-25 10:43:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:15,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098609392] [2024-09-25 10:43:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:15,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:15,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:43:16,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:16,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098609392] [2024-09-25 10:43:16,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098609392] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:16,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:16,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094774942] [2024-09-25 10:43:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:16,003 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:16,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:16,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:16,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:16,004 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:16,106 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-09-25 10:43:16,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:16,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 10:43:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:16,108 INFO L225 Difference]: With dead ends: 36 [2024-09-25 10:43:16,108 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 10:43:16,108 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:16,109 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:16,109 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 110 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 10:43:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-25 10:43:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:43:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-25 10:43:16,118 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 16 [2024-09-25 10:43:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:16,119 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-25 10:43:16,119 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:16,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-25 10:43:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:43:16,120 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:16,120 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:16,120 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:43:16,120 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:16,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash -295453008, now seen corresponding path program 1 times [2024-09-25 10:43:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:16,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722829620] [2024-09-25 10:43:16,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:16,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [599330625] [2024-09-25 10:43:16,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:16,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:16,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:16,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:16,140 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:43:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:16,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:43:16,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:43:16,252 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:16,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:16,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722829620] [2024-09-25 10:43:16,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599330625] [2024-09-25 10:43:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599330625] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:16,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:16,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:16,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124826218] [2024-09-25 10:43:16,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:16,255 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:16,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:16,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:16,256 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:43:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:16,325 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-09-25 10:43:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:16,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-25 10:43:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:16,330 INFO L225 Difference]: With dead ends: 53 [2024-09-25 10:43:16,331 INFO L226 Difference]: Without dead ends: 51 [2024-09-25 10:43:16,331 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:16,332 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:16,332 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 131 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-25 10:43:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2024-09-25 10:43:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-25 10:43:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-09-25 10:43:16,345 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 21 [2024-09-25 10:43:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:16,345 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-09-25 10:43:16,345 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:43:16,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-09-25 10:43:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 10:43:16,347 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:16,348 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:16,363 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:43:16,548 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:16,549 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:16,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash 291539359, now seen corresponding path program 1 times [2024-09-25 10:43:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:16,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737556960] [2024-09-25 10:43:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896382863] [2024-09-25 10:43:16,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:16,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:16,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:16,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:16,577 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:43:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:16,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:43:16,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:43:16,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:16,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:16,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737556960] [2024-09-25 10:43:16,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:16,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896382863] [2024-09-25 10:43:16,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896382863] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:16,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:16,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203225265] [2024-09-25 10:43:16,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:16,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:16,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:16,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:16,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:16,679 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:43:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:16,754 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-09-25 10:43:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-09-25 10:43:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:16,756 INFO L225 Difference]: With dead ends: 57 [2024-09-25 10:43:16,756 INFO L226 Difference]: Without dead ends: 55 [2024-09-25 10:43:16,756 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-25 10:43:16,757 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:16,757 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 128 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-25 10:43:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-09-25 10:43:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-25 10:43:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-09-25 10:43:16,768 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 26 [2024-09-25 10:43:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:16,768 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-09-25 10:43:16,768 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:43:16,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-09-25 10:43:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 10:43:16,769 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:16,769 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:16,781 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:43:16,970 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:16,971 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:16,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1228581936, now seen corresponding path program 1 times [2024-09-25 10:43:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63922458] [2024-09-25 10:43:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:16,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632990369] [2024-09-25 10:43:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:16,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:16,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:16,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:16,995 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:43:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:17,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:43:17,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:43:17,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:17,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:17,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63922458] [2024-09-25 10:43:17,083 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:17,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632990369] [2024-09-25 10:43:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632990369] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:17,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:17,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397256091] [2024-09-25 10:43:17,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:17,084 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:17,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:17,085 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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-25 10:43:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:17,145 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2024-09-25 10:43:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:17,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 31 [2024-09-25 10:43:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:17,146 INFO L225 Difference]: With dead ends: 65 [2024-09-25 10:43:17,146 INFO L226 Difference]: Without dead ends: 53 [2024-09-25 10:43:17,147 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:17,147 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:17,147 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 120 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-25 10:43:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-25 10:43:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-25 10:43:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-09-25 10:43:17,156 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 31 [2024-09-25 10:43:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:17,157 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-09-25 10:43:17,157 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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-25 10:43:17,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:17,157 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-09-25 10:43:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-25 10:43:17,158 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:17,158 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 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-25 10:43:17,172 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:43:17,362 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:17,363 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:17,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash 149987423, now seen corresponding path program 1 times [2024-09-25 10:43:17,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:17,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013760114] [2024-09-25 10:43:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:17,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791756335] [2024-09-25 10:43:17,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:17,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:17,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:17,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:17,396 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:43:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:17,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-25 10:43:17,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-09-25 10:43:17,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-09-25 10:43:17,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:17,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013760114] [2024-09-25 10:43:17,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:17,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791756335] [2024-09-25 10:43:17,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791756335] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:17,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:43:17,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-09-25 10:43:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145359322] [2024-09-25 10:43:17,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:17,695 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:43:17,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:17,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:43:17,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:43:17,696 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2024-09-25 10:43:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:17,878 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2024-09-25 10:43:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:43:17,879 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 48 [2024-09-25 10:43:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:17,880 INFO L225 Difference]: With dead ends: 76 [2024-09-25 10:43:17,880 INFO L226 Difference]: Without dead ends: 74 [2024-09-25 10:43:17,880 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:43:17,881 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:17,881 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-25 10:43:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2024-09-25 10:43:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 32 states have (on average 1.0625) internal successors, (34), 33 states have internal predecessors, (34), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-25 10:43:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-09-25 10:43:17,895 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 48 [2024-09-25 10:43:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:17,895 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-09-25 10:43:17,895 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2024-09-25 10:43:17,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-09-25 10:43:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-25 10:43:17,896 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:17,896 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:17,915 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:43:18,097 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:18,097 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:18,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash -883401392, now seen corresponding path program 2 times [2024-09-25 10:43:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:18,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942151828] [2024-09-25 10:43:18,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:18,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:18,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561480452] [2024-09-25 10:43:18,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:43:18,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:18,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:18,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:18,115 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:43:18,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:43:18,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:43:18,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-25 10:43:18,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-09-25 10:43:18,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-09-25 10:43:18,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:18,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942151828] [2024-09-25 10:43:18,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:18,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561480452] [2024-09-25 10:43:18,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561480452] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:18,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:43:18,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-09-25 10:43:18,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175344125] [2024-09-25 10:43:18,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:18,389 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 10:43:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:18,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 10:43:18,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:43:18,390 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) [2024-09-25 10:43:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:18,625 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2024-09-25 10:43:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:43:18,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) Word has length 53 [2024-09-25 10:43:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:18,628 INFO L225 Difference]: With dead ends: 90 [2024-09-25 10:43:18,628 INFO L226 Difference]: Without dead ends: 85 [2024-09-25 10:43:18,629 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:43:18,629 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:18,629 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 265 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:43:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-09-25 10:43:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2024-09-25 10:43:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 43 states have (on average 1.069767441860465) internal successors, (46), 45 states have internal predecessors, (46), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-25 10:43:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2024-09-25 10:43:18,654 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 53 [2024-09-25 10:43:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:18,654 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2024-09-25 10:43:18,654 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) [2024-09-25 10:43:18,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2024-09-25 10:43:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-25 10:43:18,656 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:18,656 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 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] [2024-09-25 10:43:18,668 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 10:43:18,856 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:43:18,857 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:18,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:18,858 INFO L85 PathProgramCache]: Analyzing trace with hash -612037408, now seen corresponding path program 1 times [2024-09-25 10:43:18,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:18,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603016943] [2024-09-25 10:43:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:18,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [264325553] [2024-09-25 10:43:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:18,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:18,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:18,912 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:18,917 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:43:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:18,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 10:43:18,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 10:43:19,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 10:43:19,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603016943] [2024-09-25 10:43:19,392 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:19,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264325553] [2024-09-25 10:43:19,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264325553] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:19,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:43:19,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-25 10:43:19,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222412147] [2024-09-25 10:43:19,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:19,394 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:43:19,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:19,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:43:19,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:43:19,396 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2024-09-25 10:43:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:19,592 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2024-09-25 10:43:19,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:43:19,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 74 [2024-09-25 10:43:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:19,594 INFO L225 Difference]: With dead ends: 110 [2024-09-25 10:43:19,595 INFO L226 Difference]: Without dead ends: 108 [2024-09-25 10:43:19,595 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:43:19,596 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:19,596 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 170 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-09-25 10:43:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2024-09-25 10:43:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 57 states have internal predecessors, (58), 34 states have call successors, (34), 16 states have call predecessors, (34), 15 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-09-25 10:43:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2024-09-25 10:43:19,635 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 74 [2024-09-25 10:43:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:19,636 INFO L474 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2024-09-25 10:43:19,636 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2024-09-25 10:43:19,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2024-09-25 10:43:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-25 10:43:19,637 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:19,637 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 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] [2024-09-25 10:43:19,654 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:43:19,838 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:19,838 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:19,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1655042001, now seen corresponding path program 1 times [2024-09-25 10:43:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:19,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193750539] [2024-09-25 10:43:19,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:19,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:19,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130428931] [2024-09-25 10:43:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:19,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:19,863 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:19,864 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:43:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:19,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 10:43:19,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-25 10:43:20,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-25 10:43:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:20,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193750539] [2024-09-25 10:43:20,271 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:20,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130428931] [2024-09-25 10:43:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130428931] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:20,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:43:20,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-09-25 10:43:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428071736] [2024-09-25 10:43:20,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:20,272 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 10:43:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 10:43:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:43:20,273 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 15 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 7 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (27), 8 states have call predecessors, (27), 7 states have call successors, (27) [2024-09-25 10:43:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:20,578 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2024-09-25 10:43:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:43:20,579 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 7 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (27), 8 states have call predecessors, (27), 7 states have call successors, (27) Word has length 79 [2024-09-25 10:43:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:20,580 INFO L225 Difference]: With dead ends: 122 [2024-09-25 10:43:20,580 INFO L226 Difference]: Without dead ends: 113 [2024-09-25 10:43:20,580 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:43:20,581 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:20,581 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 336 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:43:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-09-25 10:43:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-09-25 10:43:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.05) internal successors, (63), 62 states have internal predecessors, (63), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-25 10:43:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2024-09-25 10:43:20,630 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 79 [2024-09-25 10:43:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:20,630 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2024-09-25 10:43:20,630 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 7 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (27), 8 states have call predecessors, (27), 7 states have call successors, (27) [2024-09-25 10:43:20,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2024-09-25 10:43:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-25 10:43:20,631 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:20,632 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:20,652 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-25 10:43:20,835 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:20,839 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:20,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:20,840 INFO L85 PathProgramCache]: Analyzing trace with hash -875039120, now seen corresponding path program 3 times [2024-09-25 10:43:20,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:20,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565239982] [2024-09-25 10:43:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:20,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:20,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594557572] [2024-09-25 10:43:20,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:43:20,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:20,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:20,870 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:20,871 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:43:20,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 10:43:20,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:43:20,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 10:43:20,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-25 10:43:21,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-25 10:43:21,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:21,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565239982] [2024-09-25 10:43:21,452 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:21,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594557572] [2024-09-25 10:43:21,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594557572] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:21,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:43:21,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-09-25 10:43:21,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756098812] [2024-09-25 10:43:21,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:21,453 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 10:43:21,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:21,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 10:43:21,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:43:21,453 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2024-09-25 10:43:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:22,124 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2024-09-25 10:43:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 10:43:22,124 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) Word has length 85 [2024-09-25 10:43:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:22,125 INFO L225 Difference]: With dead ends: 133 [2024-09-25 10:43:22,126 INFO L226 Difference]: Without dead ends: 115 [2024-09-25 10:43:22,126 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:43:22,126 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:22,126 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 271 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:43:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-09-25 10:43:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-09-25 10:43:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 67 states have internal predecessors, (68), 27 states have call successors, (27), 20 states have call predecessors, (27), 19 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-25 10:43:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2024-09-25 10:43:22,145 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 85 [2024-09-25 10:43:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:22,145 INFO L474 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2024-09-25 10:43:22,145 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2024-09-25 10:43:22,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2024-09-25 10:43:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-09-25 10:43:22,147 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:22,147 INFO L216 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:22,153 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 10:43:22,347 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:22,347 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:22,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2107835968, now seen corresponding path program 2 times [2024-09-25 10:43:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:22,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748435890] [2024-09-25 10:43:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:22,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678204922] [2024-09-25 10:43:22,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:43:22,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:22,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:22,370 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:22,370 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 10:43:22,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:43:22,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:43:22,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-25 10:43:22,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 86 proven. 58 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-09-25 10:43:22,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-09-25 10:43:23,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:23,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748435890] [2024-09-25 10:43:23,484 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:23,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678204922] [2024-09-25 10:43:23,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678204922] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:23,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:43:23,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-09-25 10:43:23,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660276781] [2024-09-25 10:43:23,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:23,485 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 10:43:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 10:43:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:43:23,485 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 10 states have call successors, (37), 3 states have call predecessors, (37), 2 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2024-09-25 10:43:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:23,967 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-09-25 10:43:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 10:43:23,967 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 10 states have call successors, (37), 3 states have call predecessors, (37), 2 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 128 [2024-09-25 10:43:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:23,968 INFO L225 Difference]: With dead ends: 136 [2024-09-25 10:43:23,969 INFO L226 Difference]: Without dead ends: 134 [2024-09-25 10:43:23,969 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:43:23,969 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:23,969 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 299 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:43:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-09-25 10:43:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2024-09-25 10:43:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 27 states have call successors, (27), 21 states have call predecessors, (27), 20 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-25 10:43:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2024-09-25 10:43:23,997 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 128 [2024-09-25 10:43:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:23,998 INFO L474 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2024-09-25 10:43:23,998 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 10 states have call successors, (37), 3 states have call predecessors, (37), 2 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2024-09-25 10:43:23,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2024-09-25 10:43:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-09-25 10:43:23,999 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:23,999 INFO L216 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:24,015 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 10:43:24,199 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 10:43:24,199 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:24,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1340142287, now seen corresponding path program 2 times [2024-09-25 10:43:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180592334] [2024-09-25 10:43:24,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79102568] [2024-09-25 10:43:24,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:43:24,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:24,221 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:24,222 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 10:43:24,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:43:24,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:43:24,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-25 10:43:24,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 88 proven. 61 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-09-25 10:43:24,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 88 proven. 61 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-09-25 10:43:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180592334] [2024-09-25 10:43:25,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79102568] [2024-09-25 10:43:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79102568] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:25,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:43:25,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-09-25 10:43:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879000170] [2024-09-25 10:43:25,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:25,254 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 10:43:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:25,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 10:43:25,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:43:25,255 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 21 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 14 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (47), 12 states have call predecessors, (47), 14 states have call successors, (47) [2024-09-25 10:43:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:25,902 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2024-09-25 10:43:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 10:43:25,902 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 14 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (47), 12 states have call predecessors, (47), 14 states have call successors, (47) Word has length 133 [2024-09-25 10:43:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:25,904 INFO L225 Difference]: With dead ends: 149 [2024-09-25 10:43:25,904 INFO L226 Difference]: Without dead ends: 145 [2024-09-25 10:43:25,904 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2024-09-25 10:43:25,905 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:25,905 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 464 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:43:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-09-25 10:43:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2024-09-25 10:43:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 27 states have call successors, (27), 22 states have call predecessors, (27), 20 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-25 10:43:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2024-09-25 10:43:25,937 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 133 [2024-09-25 10:43:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:25,937 INFO L474 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2024-09-25 10:43:25,937 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 14 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (47), 12 states have call predecessors, (47), 14 states have call successors, (47) [2024-09-25 10:43:25,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2024-09-25 10:43:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-25 10:43:25,938 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:25,938 INFO L216 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:25,952 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-25 10:43:26,142 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-25 10:43:26,143 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:26,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash 127442784, now seen corresponding path program 1 times [2024-09-25 10:43:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458260150] [2024-09-25 10:43:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:26,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888873354] [2024-09-25 10:43:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:26,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:26,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:26,177 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:26,178 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 10:43:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:26,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-25 10:43:26,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 45 proven. 109 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-09-25 10:43:26,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 45 proven. 109 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-09-25 10:43:27,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:27,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458260150] [2024-09-25 10:43:27,368 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:27,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888873354] [2024-09-25 10:43:27,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888873354] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:27,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:43:27,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-09-25 10:43:27,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665674778] [2024-09-25 10:43:27,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:27,369 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 10:43:27,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:27,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 10:43:27,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:43:27,369 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 10 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (48), 9 states have call predecessors, (48), 10 states have call successors, (48) [2024-09-25 10:43:31,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:43:36,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:43:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:36,336 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2024-09-25 10:43:36,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 10:43:36,337 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 10 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (48), 9 states have call predecessors, (48), 10 states have call successors, (48) Word has length 138 [2024-09-25 10:43:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:36,337 INFO L225 Difference]: With dead ends: 134 [2024-09-25 10:43:36,337 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:43:36,338 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:43:36,338 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:36,339 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 348 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 260 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-09-25 10:43:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:43:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:43:36,339 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-25 10:43:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:43:36,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2024-09-25 10:43:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:36,340 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:43:36,340 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 10 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (48), 9 states have call predecessors, (48), 10 states have call successors, (48) [2024-09-25 10:43:36,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:43:36,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:43:36,342 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:43:36,355 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-25 10:43:36,546 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:36,549 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:36,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:43:57,250 WARN L293 SmtUtils]: Spent 19.93s on a formula simplification. DAG size of input: 192 DAG size of output: 62 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:44:19,817 WARN L293 SmtUtils]: Spent 22.56s on a formula simplification. DAG size of input: 193 DAG size of output: 54 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:44:52,146 WARN L293 SmtUtils]: Spent 32.32s on a formula simplification. DAG size of input: 193 DAG size of output: 54 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:45:09,072 WARN L293 SmtUtils]: Spent 16.91s on a formula simplification. DAG size of input: 193 DAG size of output: 54 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:45:18,437 WARN L293 SmtUtils]: Spent 9.21s on a formula simplification. DAG size of input: 176 DAG size of output: 43 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:45:47,067 WARN L293 SmtUtils]: Spent 28.63s on a formula simplification. DAG size of input: 206 DAG size of output: 63 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:45:56,936 WARN L293 SmtUtils]: Spent 9.87s on a formula simplification. DAG size of input: 175 DAG size of output: 55 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:46:21,921 WARN L293 SmtUtils]: Spent 24.86s on a formula simplification. DAG size of input: 206 DAG size of output: 63 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:46:38,268 WARN L293 SmtUtils]: Spent 16.34s on a formula simplification. DAG size of input: 177 DAG size of output: 56 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:47:06,457 WARN L293 SmtUtils]: Spent 28.17s on a formula simplification. DAG size of input: 175 DAG size of output: 55 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:47:19,845 WARN L293 SmtUtils]: Spent 13.36s on a formula simplification. DAG size of input: 193 DAG size of output: 54 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:47:19,855 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:47:19,881 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:47:19,883 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:47:19,883 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:47:19,883 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:47:19,883 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:47:19,884 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:47:19,884 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:47:19,884 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:47:19,888 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:47:19,888 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:47:19,888 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:47:19,888 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:47:19,888 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:47:19,888 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:47:19,888 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:47:19,888 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:47:19,889 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:47:19,889 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:47:19,889 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:47:19,889 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:47:19,889 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:47:19,889 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:47:19,889 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:47:19,889 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:47:19,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:47:19 BoogieIcfgContainer [2024-09-25 10:47:19,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:47:19,890 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:47:19,890 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:47:19,891 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:47:19,891 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:43:15" (3/4) ... [2024-09-25 10:47:19,892 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:47:19,941 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:47:19,941 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:47:19,942 INFO L158 Benchmark]: Toolchain (without parser) took 244996.00ms. Allocated memory was 65.0MB in the beginning and 197.1MB in the end (delta: 132.1MB). Free memory was 43.7MB in the beginning and 147.2MB in the end (delta: -103.5MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-09-25 10:47:19,942 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory was 41.4MB in the beginning and 41.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:47:19,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.66ms. Allocated memory is still 65.0MB. Free memory was 43.5MB in the beginning and 31.7MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 10:47:19,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.94ms. Allocated memory is still 65.0MB. Free memory was 31.5MB in the beginning and 30.6MB in the end (delta: 905.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:47:19,943 INFO L158 Benchmark]: Boogie Preprocessor took 41.05ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 30.6MB in the beginning and 75.9MB in the end (delta: -45.3MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-09-25 10:47:19,944 INFO L158 Benchmark]: RCFGBuilder took 284.85ms. Allocated memory is still 94.4MB. Free memory was 75.9MB in the beginning and 62.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 10:47:19,944 INFO L158 Benchmark]: TraceAbstraction took 244431.63ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 62.0MB in the beginning and 149.3MB in the end (delta: -87.4MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2024-09-25 10:47:19,944 INFO L158 Benchmark]: Witness Printer took 51.15ms. Allocated memory is still 197.1MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:47:19,946 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory was 41.4MB in the beginning and 41.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.66ms. Allocated memory is still 65.0MB. Free memory was 43.5MB in the beginning and 31.7MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.94ms. Allocated memory is still 65.0MB. Free memory was 31.5MB in the beginning and 30.6MB in the end (delta: 905.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.05ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 30.6MB in the beginning and 75.9MB in the end (delta: -45.3MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * RCFGBuilder took 284.85ms. Allocated memory is still 94.4MB. Free memory was 75.9MB in the beginning and 62.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 244431.63ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 62.0MB in the beginning and 149.3MB in the end (delta: -87.4MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. * Witness Printer took 51.15ms. Allocated memory is still 197.1MB. Free memory was 149.3MB in the beginning and 147.2MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 13, TraceHistogramMax: 24, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 2817 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2343 mSDsCounter, 374 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2136 IncrementalHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 374 mSolverCounterUnsat, 474 mSDtfsCounter, 2136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 1438 SyntacticMatches, 3 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=12, InterpolantAutomatonStates: 115, 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, 13 MinimizatonAttempts, 81 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1624 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1565 ConstructedInterpolants, 0 QuantifiedInterpolants, 7574 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1799 ConjunctsInSsa, 272 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 7706/8248 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: 33]: Loop Invariant Derived loop invariant: ((((((((((((__int128) 7 * z) + ((__int128) y * 46)) + (((__int128) z * x) * 3)) + ((__int128) x * 36)) == ((((2 * ((__int128) y * y)) + (((__int128) z * z) * 2)) + 8) + ((__int128) z * y))) && ((((((__int128) x * 18) + (((__int128) z * x) * 3)) + ((__int128) y * 10)) + 10) == ((2 * ((__int128) y * y)) + ((__int128) z * 3)))) && ((((__int128) n * 6) + 6) == z)) && (0 <= a)) && (((((2 * ((__int128) y * y)) + (((__int128) z * z) * 5)) + 38) + (2 * ((__int128) z * y))) == (((((__int128) 23 * z) + (((__int128) z * x) * 3)) + ((__int128) x * 54)) + ((__int128) 94 * y)))) && ((n < (a + 1)) || (((__int128) z * x) == (((__int128) x * 12) + (((__int128) a * x) * 6))))) && (a <= 10)) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:47:19,976 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