./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 --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:36:57,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:36:57,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:36:57,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:36:57,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:36:58,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:36:58,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:36:58,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:36:58,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:36:58,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:36:58,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:36:58,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:36:58,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:36:58,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:36:58,029 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:36:58,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:36:58,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:36:58,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:36:58,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:36:58,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:36:58,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:36:58,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:36:58,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:36:58,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:36:58,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:36:58,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:36:58,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:36:58,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:36:58,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:36:58,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:36:58,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:36:58,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:36:58,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:36:58,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:36:58,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:36:58,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:36:58,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:36:58,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:36:58,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:36:58,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:36:58,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:36:58,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:36:58,041 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 -> c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 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:36:58,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:36:58,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:36:58,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:36:58,369 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:36:58,370 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:36:58,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2024-09-25 10:36:59,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:37:00,066 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:37:00,067 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2024-09-25 10:37:00,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c039064fd/7f30e744d8b3479f937f76c51c09ba61/FLAGd76c76519 [2024-09-25 10:37:00,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c039064fd/7f30e744d8b3479f937f76c51c09ba61 [2024-09-25 10:37:00,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:37:00,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:37:00,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:37:00,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:37:00,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:37:00,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f44b127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00, skipping insertion in model container [2024-09-25 10:37:00,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:37:00,302 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i[873,886] [2024-09-25 10:37:00,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:37:00,326 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:37:00,338 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i[873,886] [2024-09-25 10:37:00,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:37:00,361 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:37:00,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00 WrapperNode [2024-09-25 10:37:00,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:37:00,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:37:00,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:37:00,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:37:00,370 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:37:00" (1/1) ... [2024-09-25 10:37:00,376 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:37:00" (1/1) ... [2024-09-25 10:37:00,382 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:37:00,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:37:00,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:37:00,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:37:00,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:37:00,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,409 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:37:00,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:37:00,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:37:00,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:37:00,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:37:00,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (1/1) ... [2024-09-25 10:37:00,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:37:00,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:00,453 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:37:00,459 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:37:00,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:37:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:37:00,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:37:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:37:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:37:00,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:37:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:37:00,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:37:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:37:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:37:00,585 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:37:00,587 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:37:00,712 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-25 10:37:00,713 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:37:00,736 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:37:00,736 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:37:00,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:37:00 BoogieIcfgContainer [2024-09-25 10:37:00,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:37:00,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:37:00,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:37:00,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:37:00,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:37:00" (1/3) ... [2024-09-25 10:37:00,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52560342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:37:00, skipping insertion in model container [2024-09-25 10:37:00,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:00" (2/3) ... [2024-09-25 10:37:00,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52560342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:37:00, skipping insertion in model container [2024-09-25 10:37:00,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:37:00" (3/3) ... [2024-09-25 10:37:00,746 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark23_conjunctive.i [2024-09-25 10:37:00,761 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:37:00,761 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:37:00,818 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:37:00,826 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;@21d536e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:37:00,826 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:37:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:37:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:37:00,837 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:00,838 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:00,838 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:00,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2024973783, now seen corresponding path program 1 times [2024-09-25 10:37:00,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:00,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574403633] [2024-09-25 10:37:00,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:00,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:01,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:01,042 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:37:01,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:01,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574403633] [2024-09-25 10:37:01,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574403633] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:37:01,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:37:01,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:37:01,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203213392] [2024-09-25 10:37:01,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:37:01,052 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:37:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:01,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:37:01,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:37:01,076 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:01,122 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-09-25 10:37:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:37:01,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 10:37:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:01,131 INFO L225 Difference]: With dead ends: 32 [2024-09-25 10:37:01,131 INFO L226 Difference]: Without dead ends: 13 [2024-09-25 10:37:01,134 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:37:01,140 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:01,140 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:37:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-25 10:37:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-25 10:37:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-09-25 10:37:01,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2024-09-25 10:37:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:01,174 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-09-25 10:37:01,174 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:01,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-09-25 10:37:01,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 10:37:01,176 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:01,176 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:01,177 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:37:01,177 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:01,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:01,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1613890659, now seen corresponding path program 1 times [2024-09-25 10:37:01,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:01,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213816440] [2024-09-25 10:37:01,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:01,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:01,267 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:01,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:01,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213816440] [2024-09-25 10:37:01,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213816440] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:01,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702900064] [2024-09-25 10:37:01,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:01,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:01,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:01,276 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:37:01,278 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:37:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:01,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-25 10:37:01,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:01,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:01,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702900064] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:01,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:01,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-09-25 10:37:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427139177] [2024-09-25 10:37:01,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:01,474 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:37:01,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:01,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:37:01,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:37:01,481 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:01,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:01,508 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-09-25 10:37:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:37:01,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-25 10:37:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:01,509 INFO L225 Difference]: With dead ends: 21 [2024-09-25 10:37:01,510 INFO L226 Difference]: Without dead ends: 16 [2024-09-25 10:37:01,510 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:37:01,511 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:01,513 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:37:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-25 10:37:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-25 10:37:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-09-25 10:37:01,518 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2024-09-25 10:37:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:01,521 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-09-25 10:37:01,521 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:01,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-09-25 10:37:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:37:01,523 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:01,523 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:01,539 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:37:01,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:01,725 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:01,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash 264038231, now seen corresponding path program 2 times [2024-09-25 10:37:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:01,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877049733] [2024-09-25 10:37:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:01,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:01,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:01,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:01,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877049733] [2024-09-25 10:37:01,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877049733] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:01,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888059700] [2024-09-25 10:37:01,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:37:01,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:01,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:01,887 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:37:01,889 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:37:01,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:37:01,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:37:01,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:37:01,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:01,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:02,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888059700] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:02,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:02,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-09-25 10:37:02,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87958658] [2024-09-25 10:37:02,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:02,035 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:37:02,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:02,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:37:02,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:37:02,036 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:02,074 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-09-25 10:37:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 10:37:02,075 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-25 10:37:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:02,076 INFO L225 Difference]: With dead ends: 27 [2024-09-25 10:37:02,076 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:37:02,077 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:37:02,078 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:02,078 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:37:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:37:02,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 10:37:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-09-25 10:37:02,086 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2024-09-25 10:37:02,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:02,087 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-09-25 10:37:02,088 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:02,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-09-25 10:37:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:37:02,089 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:02,090 INFO L216 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:02,105 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:37:02,290 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:02,291 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:02,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:02,291 INFO L85 PathProgramCache]: Analyzing trace with hash -380608105, now seen corresponding path program 3 times [2024-09-25 10:37:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:02,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740375085] [2024-09-25 10:37:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:02,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:02,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:02,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:02,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740375085] [2024-09-25 10:37:02,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740375085] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:02,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659070133] [2024-09-25 10:37:02,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:37:02,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:02,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:02,573 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:37:02,577 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:37:02,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-25 10:37:02,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:37:02,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:37:02,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:02,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:02,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659070133] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:02,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:02,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-09-25 10:37:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163163410] [2024-09-25 10:37:02,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:02,932 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 10:37:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:02,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 10:37:02,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:37:02,934 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:02,973 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2024-09-25 10:37:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-25 10:37:02,973 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:37:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:02,974 INFO L225 Difference]: With dead ends: 39 [2024-09-25 10:37:02,974 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 10:37:02,975 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:37:02,976 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:02,976 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:37:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 10:37:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-25 10:37:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2024-09-25 10:37:02,982 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 21 [2024-09-25 10:37:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:02,982 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2024-09-25 10:37:02,982 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:02,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2024-09-25 10:37:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-25 10:37:02,984 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:02,984 INFO L216 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:02,997 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:37:03,188 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:03,189 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:03,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash 559760919, now seen corresponding path program 4 times [2024-09-25 10:37:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177310465] [2024-09-25 10:37:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:03,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:03,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177310465] [2024-09-25 10:37:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177310465] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695529786] [2024-09-25 10:37:03,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:37:03,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:03,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:03,777 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:37:03,779 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:37:03,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:37:03,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:37:03,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 10:37:03,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:03,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:04,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695529786] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:04,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:04,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-09-25 10:37:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547468893] [2024-09-25 10:37:04,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:04,699 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-25 10:37:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:04,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-25 10:37:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-09-25 10:37:04,702 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:04,762 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2024-09-25 10:37:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-09-25 10:37:04,762 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-09-25 10:37:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:04,765 INFO L225 Difference]: With dead ends: 63 [2024-09-25 10:37:04,765 INFO L226 Difference]: Without dead ends: 58 [2024-09-25 10:37:04,766 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-09-25 10:37:04,767 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:04,767 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:37:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-25 10:37:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-25 10:37:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2024-09-25 10:37:04,774 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 33 [2024-09-25 10:37:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:04,775 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2024-09-25 10:37:04,775 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:04,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2024-09-25 10:37:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-25 10:37:04,777 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:04,777 INFO L216 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:04,795 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:37:04,981 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:04,982 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:04,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1954623721, now seen corresponding path program 5 times [2024-09-25 10:37:04,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:04,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339792019] [2024-09-25 10:37:04,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:06,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:06,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339792019] [2024-09-25 10:37:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339792019] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69347728] [2024-09-25 10:37:06,465 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:37:06,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:06,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:06,469 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:37:06,470 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:37:06,546 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-09-25 10:37:06,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:37:06,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-25 10:37:06,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:06,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:09,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69347728] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:09,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:09,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2024-09-25 10:37:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657506713] [2024-09-25 10:37:09,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:09,222 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-09-25 10:37:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:09,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-09-25 10:37:09,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-09-25 10:37:09,229 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:09,379 INFO L93 Difference]: Finished difference Result 111 states and 158 transitions. [2024-09-25 10:37:09,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-09-25 10:37:09,380 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2024-09-25 10:37:09,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:09,381 INFO L225 Difference]: With dead ends: 111 [2024-09-25 10:37:09,381 INFO L226 Difference]: Without dead ends: 106 [2024-09-25 10:37:09,383 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-09-25 10:37:09,385 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:09,387 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:37:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-25 10:37:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-09-25 10:37:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.00990099009901) internal successors, (102), 101 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2024-09-25 10:37:09,407 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 57 [2024-09-25 10:37:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:09,408 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2024-09-25 10:37:09,409 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:09,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2024-09-25 10:37:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-09-25 10:37:09,412 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:09,412 INFO L216 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:09,432 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:37:09,612 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:37:09,613 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:09,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1553932009, now seen corresponding path program 6 times [2024-09-25 10:37:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:09,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241913950] [2024-09-25 10:37:09,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:14,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241913950] [2024-09-25 10:37:14,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241913950] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:14,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188023598] [2024-09-25 10:37:14,423 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:37:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:14,424 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:37:14,430 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:37:14,557 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2024-09-25 10:37:14,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:37:14,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-09-25 10:37:14,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:14,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:18,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188023598] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:18,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:18,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2024-09-25 10:37:18,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372639301] [2024-09-25 10:37:18,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:18,239 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-09-25 10:37:18,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-09-25 10:37:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2024-09-25 10:37:18,243 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:18,377 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2024-09-25 10:37:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-09-25 10:37:18,377 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-09-25 10:37:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:18,379 INFO L225 Difference]: With dead ends: 117 [2024-09-25 10:37:18,379 INFO L226 Difference]: Without dead ends: 112 [2024-09-25 10:37:18,381 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 118 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2024-09-25 10:37:18,382 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:18,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:37:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-09-25 10:37:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-09-25 10:37:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 107 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2024-09-25 10:37:18,392 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 105 [2024-09-25 10:37:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:18,392 INFO L474 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2024-09-25 10:37:18,392 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:18,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2024-09-25 10:37:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-09-25 10:37:18,394 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:18,394 INFO L216 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:18,409 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:37:18,595 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:18,595 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:18,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1828582569, now seen corresponding path program 7 times [2024-09-25 10:37:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:18,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348485728] [2024-09-25 10:37:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:18,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:23,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:23,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:23,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348485728] [2024-09-25 10:37:23,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348485728] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:23,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798762779] [2024-09-25 10:37:23,466 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:37:23,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:23,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:23,468 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:37:23,471 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:37:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:23,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 205 conjuncts are in the unsatisfiable core [2024-09-25 10:37:23,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:23,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798762779] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:24,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 107 [2024-09-25 10:37:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260898778] [2024-09-25 10:37:24,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:24,273 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2024-09-25 10:37:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:24,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2024-09-25 10:37:24,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11129, Unknown=0, NotChecked=0, Total=11342 [2024-09-25 10:37:24,277 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 105 states have internal predecessors, (109), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:27,863 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2024-09-25 10:37:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-09-25 10:37:27,864 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 105 states have internal predecessors, (109), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2024-09-25 10:37:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:27,865 INFO L225 Difference]: With dead ends: 118 [2024-09-25 10:37:27,865 INFO L226 Difference]: Without dead ends: 113 [2024-09-25 10:37:27,868 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=219, Invalid=11337, Unknown=0, NotChecked=0, Total=11556 [2024-09-25 10:37:27,868 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 10919 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 10919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:27,869 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 740 Invalid, 10919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10919 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-09-25 10:37:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-09-25 10:37:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-09-25 10:37:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2024-09-25 10:37:27,881 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2024-09-25 10:37:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:27,882 INFO L474 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2024-09-25 10:37:27,882 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 105 states have internal predecessors, (109), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:27,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2024-09-25 10:37:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-09-25 10:37:27,884 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:27,884 INFO L216 NwaCegarLoop]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:27,901 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 10:37:28,088 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:28,089 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:28,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:28,089 INFO L85 PathProgramCache]: Analyzing trace with hash -815053283, now seen corresponding path program 8 times [2024-09-25 10:37:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:28,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90131652] [2024-09-25 10:37:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:32,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:37:32,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90131652] [2024-09-25 10:37:32,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90131652] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:37:32,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:37:32,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2024-09-25 10:37:32,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71991812] [2024-09-25 10:37:32,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:37:32,787 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-09-25 10:37:32,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:32,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-09-25 10:37:32,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-09-25 10:37:32,792 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:33,091 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2024-09-25 10:37:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-09-25 10:37:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-09-25 10:37:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:33,092 INFO L225 Difference]: With dead ends: 113 [2024-09-25 10:37:33,092 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:37:33,095 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-09-25 10:37:33,095 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:33,095 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:37:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:37:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:37:33,096 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:37:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:37:33,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2024-09-25 10:37:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:33,097 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:37:33,097 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:37:33,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:37:33,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:37:33,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:37:33,102 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-25 10:37:33,104 INFO L408 BasicCegarLoop]: Path program histogram: [8, 1] [2024-09-25 10:37:33,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:37:34,333 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:37:34,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:37:34,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:37:34,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:37:34,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:37:34,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:37:34,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:37:34,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:37:34,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:37:34,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:37:34,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:37:34,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:37:34,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:37:34,382 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:37:34,382 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:37:34,382 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:37:34,382 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:37:34,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:37:34 BoogieIcfgContainer [2024-09-25 10:37:34,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:37:34,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:37:34,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:37:34,384 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:37:34,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:37:00" (3/4) ... [2024-09-25 10:37:34,390 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:37:34,456 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:37:34,456 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:37:34,457 INFO L158 Benchmark]: Toolchain (without parser) took 34351.24ms. Allocated memory was 92.3MB in the beginning and 285.2MB in the end (delta: 192.9MB). Free memory was 52.2MB in the beginning and 130.7MB in the end (delta: -78.6MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2024-09-25 10:37:34,457 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:37:34,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.00ms. Allocated memory is still 92.3MB. Free memory was 52.2MB in the beginning and 40.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 10:37:34,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.99ms. Allocated memory is still 92.3MB. Free memory was 40.9MB in the beginning and 40.1MB in the end (delta: 823.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:37:34,458 INFO L158 Benchmark]: Boogie Preprocessor took 34.82ms. Allocated memory is still 92.3MB. Free memory was 40.1MB in the beginning and 38.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:37:34,458 INFO L158 Benchmark]: RCFGBuilder took 318.38ms. Allocated memory is still 92.3MB. Free memory was 38.4MB in the beginning and 64.2MB in the end (delta: -25.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-25 10:37:34,459 INFO L158 Benchmark]: TraceAbstraction took 33643.25ms. Allocated memory was 92.3MB in the beginning and 285.2MB in the end (delta: 192.9MB). Free memory was 63.7MB in the beginning and 132.8MB in the end (delta: -69.1MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. [2024-09-25 10:37:34,459 INFO L158 Benchmark]: Witness Printer took 72.47ms. Allocated memory is still 285.2MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:37:34,461 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.18ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.00ms. Allocated memory is still 92.3MB. Free memory was 52.2MB in the beginning and 40.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.99ms. Allocated memory is still 92.3MB. Free memory was 40.9MB in the beginning and 40.1MB in the end (delta: 823.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.82ms. Allocated memory is still 92.3MB. Free memory was 40.1MB in the beginning and 38.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 318.38ms. Allocated memory is still 92.3MB. Free memory was 38.4MB in the beginning and 64.2MB in the end (delta: -25.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 33643.25ms. Allocated memory was 92.3MB in the beginning and 285.2MB in the end (delta: 192.9MB). Free memory was 63.7MB in the beginning and 132.8MB in the end (delta: -69.1MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. * Witness Printer took 72.47ms. Allocated memory is still 285.2MB. Free memory was 132.8MB in the beginning and 130.7MB 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 * 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: 16]: 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 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.3s, OverallIterations: 9, TraceHistogramMax: 101, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1013 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 921 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11868 IncrementalHoareTripleChecker+Invalid, 11873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 92 mSDtfsCounter, 11868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1126 GetRequests, 550 SyntacticMatches, 92 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4458 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=8, InterpolantAutomatonStates: 499, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 831 NumberOfCodeBlocks, 831 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 3090 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1679 ConjunctsInSsa, 394 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 5151/37896 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: 23]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((j == 36) && (i == 18)) || ((154 == j) && (77 == i))) || ((i == 16) && (32 == j))) || ((j == 4) && (i == 2))) || ((i == 45) && (j == 90))) || ((72 == j) && (i == 36))) || ((j == 172) && (i == 86))) || ((i == 22) && (44 == j))) || ((i == 25) && (j == 50))) || ((j == 18) && (i == 9))) || ((59 == i) && (j == 118))) || ((i == 27) && (j == 54))) || ((92 == j) && (i == 46))) || ((100 <= i) && (200 == j))) || ((i == 20) && (40 == j))) || ((i == 26) && (j == 52))) || ((19 == i) && (j == 38))) || ((44 == i) && (88 == j))) || ((j == 48) && (i == 24))) || ((i == 10) && (j == 20))) || ((91 == i) && (j == 182))) || ((j == 124) && (i == 62))) || ((j == 78) && (i == 39))) || ((i == 78) && (156 == j))) || ((5 == i) && (j == 10))) || ((98 == i) && (196 == j))) || ((152 == j) && (76 == i))) || ((i == 70) && (140 == j))) || ((j == 22) && (i == 11))) || ((35 == i) && (j == 70))) || ((30 == j) && (i == 15))) || ((95 == i) && (190 == j))) || ((64 == j) && (32 == i))) || ((30 == i) && (j == 60))) || ((j == 134) && (67 == i))) || ((29 == i) && (j == 58))) || ((j == 174) && (87 == i))) || ((81 == i) && (j == 162))) || ((i == 82) && (164 == j))) || ((84 == j) && (42 == i))) || ((i == 12) && (j == 24))) || ((184 == j) && (92 == i))) || ((i == 61) && (j == 122))) || ((j == 166) && (i == 83))) || ((j == 120) && (i == 60))) || ((i == 50) && (j == 100))) || ((i == 52) && (104 == j))) || ((i == 85) && (170 == j))) || ((57 == i) && (j == 114))) || ((i == 79) && (j == 158))) || ((i == 89) && (178 == j))) || ((i == 3) && (j == 6))) || ((j == 74) && (i == 37))) || ((j == 28) && (i == 14))) || ((68 == j) && (i == 34))) || ((7 == i) && (j == 14))) || ((56 == i) && (112 == j))) || ((i == 21) && (42 == j))) || ((i == 71) && (142 == j))) || ((i == 99) && (j == 198))) || ((23 == i) && (j == 46))) || ((j == 102) && (51 == i))) || ((146 == j) && (i == 73))) || ((76 == j) && (i == 38))) || ((108 == j) && (i == 54))) || ((192 == j) && (i == 96))) || ((j == 62) && (i == 31))) || ((i == 17) && (j == 34))) || ((i == 69) && (138 == j))) || ((148 == j) && (i == 74))) || ((56 == j) && (i == 28))) || ((49 == i) && (98 == j))) || ((i == 13) && (j == 26))) || ((94 == j) && (i == 47))) || ((88 == i) && (176 == j))) || ((i == 58) && (116 == j))) || ((i == 90) && (j == 180))) || ((j == 168) && (84 == i))) || ((j == 126) && (i == 63))) || ((66 == j) && (i == 33))) || ((72 == i) && (j == 144))) || ((j == 96) && (i == 48))) || ((j == 16) && (i == 8))) || ((i == 4) && (j == 8))) || ((97 == i) && (j == 194))) || ((j == 86) && (i == 43))) || ((i == 80) && (160 == j))) || ((66 == i) && (j == 132))) || ((j == 128) && (64 == i))) || ((j == 0) && (i == 0))) || ((110 == j) && (i == 55))) || ((i == 93) && (j == 186))) || ((j == 82) && (41 == i))) || ((53 == i) && (106 == j))) || ((j == 136) && (68 == i))) || ((j == 12) && (i == 6))) || ((j == 2) && (i == 1))) || ((40 == i) && (j == 80))) || ((i == 75) && (j == 150))) || ((j == 188) && (94 == i))) || ((j == 130) && (i == 65))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:37:34,492 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE