./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/hard2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench/hard2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 966f2b433cfe84d90040e5149c3cdda56fb59546e621a76bee869282a92c61d4 --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:39:51,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:39:51,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:39:51,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:39:51,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:39:51,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:39:51,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:39:51,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:39:51,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:39:51,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:39:51,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:39:51,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:39:51,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:39:51,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:39:51,279 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:39:51,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:39:51,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:39:51,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:39:51,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:39:51,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:39:51,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:39:51,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:39:51,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:39:51,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:39:51,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:39:51,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:39:51,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:39:51,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:39:51,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:39:51,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:39:51,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:39:51,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:39:51,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:39:51,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:39:51,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:39:51,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:39:51,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:39:51,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:39:51,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:39:51,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:39:51,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:39:51,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:39:51,302 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 -> 966f2b433cfe84d90040e5149c3cdda56fb59546e621a76bee869282a92c61d4 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:39:51,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:39:51,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:39:51,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:39:51,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:39:51,639 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:39:51,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench/hard2.c [2024-09-25 10:39:53,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:39:53,344 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:39:53,344 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/hard2.c [2024-09-25 10:39:53,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a27d8536a/43b6ea16757f4571a09b3f01b0e15afa/FLAGe78e42f97 [2024-09-25 10:39:53,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a27d8536a/43b6ea16757f4571a09b3f01b0e15afa [2024-09-25 10:39:53,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:39:53,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:39:53,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:39:53,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:39:53,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:39:53,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@196441de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53, skipping insertion in model container [2024-09-25 10:39:53,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:39:53,562 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/hard2.c[526,539] [2024-09-25 10:39:53,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:39:53,594 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:39:53,609 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/hard2.c[526,539] [2024-09-25 10:39:53,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:39:53,637 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:39:53,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53 WrapperNode [2024-09-25 10:39:53,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:39:53,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:39:53,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:39:53,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:39:53,646 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:39:53" (1/1) ... [2024-09-25 10:39:53,654 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:39:53" (1/1) ... [2024-09-25 10:39:53,660 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:39:53,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:39:53,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:39:53,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:39:53,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:39:53,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,699 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-25 10:39:53,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:39:53,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:39:53,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:39:53,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:39:53,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (1/1) ... [2024-09-25 10:39:53,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:39:53,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:39:53,757 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:39:53,761 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:39:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:39:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:39:53,813 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:39:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:39:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 10:39:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:39:53,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:39:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:39:53,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:39:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:39:53,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:39:53,883 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:39:53,886 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:39:54,062 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:39:54,063 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:39:54,088 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:39:54,089 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:39:54,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:39:54 BoogieIcfgContainer [2024-09-25 10:39:54,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:39:54,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:39:54,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:39:54,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:39:54,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:39:53" (1/3) ... [2024-09-25 10:39:54,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcaf103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:39:54, skipping insertion in model container [2024-09-25 10:39:54,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:39:53" (2/3) ... [2024-09-25 10:39:54,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcaf103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:39:54, skipping insertion in model container [2024-09-25 10:39:54,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:39:54" (3/3) ... [2024-09-25 10:39:54,097 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2.c [2024-09-25 10:39:54,112 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:39:54,113 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:39:54,179 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:39:54,186 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;@38416b6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:39:54,187 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:39:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 10:39:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:39:54,201 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:39:54,202 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:39:54,203 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:39:54,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:54,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1467428880, now seen corresponding path program 1 times [2024-09-25 10:39:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:39:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596782428] [2024-09-25 10:39:54,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:39:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:54,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:39:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:54,540 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:39:54,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:39:54,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596782428] [2024-09-25 10:39:54,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596782428] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:39:54,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:39:54,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:39:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163930740] [2024-09-25 10:39:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:39:54,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:39:54,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:39:54,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:39:54,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:39:54,572 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:39:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:39:54,652 INFO L93 Difference]: Finished difference Result 62 states and 107 transitions. [2024-09-25 10:39:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:39:54,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 10:39:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:39:54,662 INFO L225 Difference]: With dead ends: 62 [2024-09-25 10:39:54,663 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 10:39:54,667 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:39:54,672 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:39:54,674 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:39:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 10:39:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2024-09-25 10:39:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 10:39:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-09-25 10:39:54,720 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2024-09-25 10:39:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:39:54,722 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-09-25 10:39:54,722 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:39:54,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-09-25 10:39:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:39:54,724 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:39:54,724 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:39:54,725 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:39:54,725 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:39:54,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:54,727 INFO L85 PathProgramCache]: Analyzing trace with hash -740867385, now seen corresponding path program 1 times [2024-09-25 10:39:54,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:39:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941138433] [2024-09-25 10:39:54,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:54,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:39:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:54,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:39:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:54,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:39:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:39:54,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:39:54,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941138433] [2024-09-25 10:39:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941138433] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:39:54,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:39:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:39:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141173231] [2024-09-25 10:39:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:39:54,914 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:39:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:39:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:39:54,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:39:54,916 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:39:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:39:54,999 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2024-09-25 10:39:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:39:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-09-25 10:39:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:39:55,001 INFO L225 Difference]: With dead ends: 40 [2024-09-25 10:39:55,001 INFO L226 Difference]: Without dead ends: 38 [2024-09-25 10:39:55,001 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:39:55,002 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:39:55,003 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:39:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-25 10:39:55,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-09-25 10:39:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 10:39:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-09-25 10:39:55,022 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 15 [2024-09-25 10:39:55,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:39:55,023 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-09-25 10:39:55,023 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:39:55,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-09-25 10:39:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:39:55,025 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:39:55,025 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:39:55,025 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:39:55,026 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:39:55,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash 51798576, now seen corresponding path program 1 times [2024-09-25 10:39:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:39:55,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085502593] [2024-09-25 10:39:55,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:55,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:39:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:39:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026792472] [2024-09-25 10:39:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:55,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:55,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:39:55,054 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:39:55,056 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:39:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:55,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:39:55,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:39:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:39:55,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:39:55,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:39:55,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085502593] [2024-09-25 10:39:55,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:39:55,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026792472] [2024-09-25 10:39:55,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026792472] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:39:55,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:39:55,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:39:55,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243199300] [2024-09-25 10:39:55,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:39:55,230 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:39:55,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:39:55,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:39:55,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:39:55,231 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:39:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:39:55,327 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2024-09-25 10:39:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:39:55,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-09-25 10:39:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:39:55,329 INFO L225 Difference]: With dead ends: 57 [2024-09-25 10:39:55,329 INFO L226 Difference]: Without dead ends: 44 [2024-09-25 10:39:55,329 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:39:55,330 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:39:55,331 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 90 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:39:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-25 10:39:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-09-25 10:39:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:39:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-09-25 10:39:55,347 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 20 [2024-09-25 10:39:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:39:55,347 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-09-25 10:39:55,348 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:39:55,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-09-25 10:39:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 10:39:55,350 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:39:55,351 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:39:55,367 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:39:55,554 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:55,555 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:39:55,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2131897932, now seen corresponding path program 1 times [2024-09-25 10:39:55,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:39:55,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990990981] [2024-09-25 10:39:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:39:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:39:55,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805667152] [2024-09-25 10:39:55,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:55,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:55,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:39:55,581 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:39:55,582 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:39:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:55,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:39:55,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:39:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:39:55,726 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:39:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:39:55,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990990981] [2024-09-25 10:39:55,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:39:55,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805667152] [2024-09-25 10:39:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805667152] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:39:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:39:55,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:39:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046459488] [2024-09-25 10:39:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:39:55,729 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:39:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:39:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:39:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:39:55,730 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:39:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:39:55,799 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2024-09-25 10:39:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:39:55,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-25 10:39:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:39:55,801 INFO L225 Difference]: With dead ends: 57 [2024-09-25 10:39:55,803 INFO L226 Difference]: Without dead ends: 55 [2024-09-25 10:39:55,803 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:39:55,804 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:39:55,806 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:39:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-25 10:39:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-09-25 10:39:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-25 10:39:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2024-09-25 10:39:55,825 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 27 [2024-09-25 10:39:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:39:55,825 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2024-09-25 10:39:55,825 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:39:55,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-09-25 10:39:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 10:39:55,829 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:39:55,829 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:39:55,846 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:39:56,029 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:56,030 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:39:56,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:56,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1419929093, now seen corresponding path program 1 times [2024-09-25 10:39:56,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:39:56,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577618556] [2024-09-25 10:39:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:39:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:39:56,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797253837] [2024-09-25 10:39:56,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:56,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:56,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:39:56,053 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:39:56,056 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:39:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:56,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 10:39:56,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:39:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:39:56,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:39:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-25 10:39:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:39:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577618556] [2024-09-25 10:39:56,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:39:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797253837] [2024-09-25 10:39:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797253837] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 10:39:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:39:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-25 10:39:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993206625] [2024-09-25 10:39:56,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:39:56,345 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:39:56,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:39:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:39:56,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:39:56,346 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:39:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:39:56,420 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2024-09-25 10:39:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:39:56,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-09-25 10:39:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:39:56,425 INFO L225 Difference]: With dead ends: 64 [2024-09-25 10:39:56,427 INFO L226 Difference]: Without dead ends: 62 [2024-09-25 10:39:56,427 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:39:56,428 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:39:56,429 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 83 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:39:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-25 10:39:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2024-09-25 10:39:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-25 10:39:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2024-09-25 10:39:56,453 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 37 [2024-09-25 10:39:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:39:56,454 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2024-09-25 10:39:56,454 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:39:56,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2024-09-25 10:39:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 10:39:56,456 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:39:56,456 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:39:56,470 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 10:39:56,659 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:56,660 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:39:56,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1229363181, now seen corresponding path program 1 times [2024-09-25 10:39:56,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:39:56,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897681031] [2024-09-25 10:39:56,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:56,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:39:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:56,765 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:39:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:56,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:39:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:56,780 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:39:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:56,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:39:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:56,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:39:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:56,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:39:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:56,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-25 10:39:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:39:56,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:39:56,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897681031] [2024-09-25 10:39:56,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897681031] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:39:56,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:39:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:39:56,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162583315] [2024-09-25 10:39:56,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:39:56,821 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:39:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:39:56,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:39:56,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:39:56,822 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 10:39:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:39:56,884 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2024-09-25 10:39:56,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:39:56,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2024-09-25 10:39:56,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:39:56,886 INFO L225 Difference]: With dead ends: 69 [2024-09-25 10:39:56,886 INFO L226 Difference]: Without dead ends: 57 [2024-09-25 10:39:56,886 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:39:56,887 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:39:56,887 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:39:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-25 10:39:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-25 10:39:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-25 10:39:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-09-25 10:39:56,899 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 43 [2024-09-25 10:39:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:39:56,900 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-09-25 10:39:56,900 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 10:39:56,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2024-09-25 10:39:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-25 10:39:56,902 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:39:56,902 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:39:56,902 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:39:56,902 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:39:56,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2039536139, now seen corresponding path program 1 times [2024-09-25 10:39:56,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:39:56,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625842738] [2024-09-25 10:39:56,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:56,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:39:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:39:56,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440152944] [2024-09-25 10:39:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:56,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:56,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:39:56,942 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:39:56,944 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:39:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:57,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-25 10:39:57,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:39:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-25 10:39:57,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:39:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-25 10:39:58,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:39:58,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625842738] [2024-09-25 10:39:58,731 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:39:58,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440152944] [2024-09-25 10:39:58,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440152944] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:39:58,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:39:58,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-09-25 10:39:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664070462] [2024-09-25 10:39:58,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:39:58,732 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 10:39:58,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:39:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 10:39:58,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:39:58,736 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 8 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2024-09-25 10:39:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:39:59,466 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2024-09-25 10:39:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:39:59,467 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 8 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 57 [2024-09-25 10:39:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:39:59,469 INFO L225 Difference]: With dead ends: 132 [2024-09-25 10:39:59,470 INFO L226 Difference]: Without dead ends: 109 [2024-09-25 10:39:59,471 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:39:59,472 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:39:59,472 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 222 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:39:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-09-25 10:39:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-09-25 10:39:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 67 states have internal predecessors, (76), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 27 states have call predecessors, (31), 31 states have call successors, (31) [2024-09-25 10:39:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2024-09-25 10:39:59,518 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 57 [2024-09-25 10:39:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:39:59,519 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2024-09-25 10:39:59,519 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 8 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2024-09-25 10:39:59,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2024-09-25 10:39:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-25 10:39:59,523 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:39:59,523 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:39:59,542 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:39:59,729 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:59,730 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:39:59,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash 620479267, now seen corresponding path program 1 times [2024-09-25 10:39:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:39:59,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35579390] [2024-09-25 10:39:59,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:39:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:39:59,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568279048] [2024-09-25 10:39:59,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:59,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:59,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:39:59,754 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:39:59,758 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:39:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:59,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 10:39:59,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-25 10:40:00,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-25 10:40:00,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:00,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35579390] [2024-09-25 10:40:00,616 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:40:00,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568279048] [2024-09-25 10:40:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568279048] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:40:00,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:40:00,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-09-25 10:40:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395948859] [2024-09-25 10:40:00,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:40:00,617 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 10:40:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:00,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 10:40:00,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:40:00,621 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 9 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) [2024-09-25 10:40:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:01,213 INFO L93 Difference]: Finished difference Result 162 states and 215 transitions. [2024-09-25 10:40:01,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 10:40:01,214 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 9 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) Word has length 68 [2024-09-25 10:40:01,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:01,216 INFO L225 Difference]: With dead ends: 162 [2024-09-25 10:40:01,218 INFO L226 Difference]: Without dead ends: 130 [2024-09-25 10:40:01,218 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:40:01,220 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:01,220 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 199 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:40:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-09-25 10:40:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2024-09-25 10:40:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 61 states have (on average 1.180327868852459) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 13 states have call predecessors, (30), 12 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-09-25 10:40:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2024-09-25 10:40:01,271 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 68 [2024-09-25 10:40:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:01,272 INFO L474 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2024-09-25 10:40:01,272 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 9 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) [2024-09-25 10:40:01,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2024-09-25 10:40:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-25 10:40:01,274 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:01,274 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:01,290 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:40:01,478 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 10:40:01,479 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:01,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash -768337324, now seen corresponding path program 1 times [2024-09-25 10:40:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:01,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605122422] [2024-09-25 10:40:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:40:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:40:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:40:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:40:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:40:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 10:40:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 10:40:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 10:40:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-25 10:40:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-25 10:40:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,951 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 10:40:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 10:40:01,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:01,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605122422] [2024-09-25 10:40:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605122422] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:40:01,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212143] [2024-09-25 10:40:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:01,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:01,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:01,957 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:40:01,962 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:40:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:02,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 10:40:02,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 10:40:02,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 10:40:02,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212143] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:40:02,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:40:02,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-09-25 10:40:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906788165] [2024-09-25 10:40:02,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:40:02,528 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 10:40:02,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:02,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 10:40:02,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:40:02,533 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 9 states have call successors, (37), 3 states have call predecessors, (37), 1 states have return successors, (33), 9 states have call predecessors, (33), 9 states have call successors, (33) [2024-09-25 10:40:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:02,772 INFO L93 Difference]: Finished difference Result 143 states and 168 transitions. [2024-09-25 10:40:02,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 10:40:02,773 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 9 states have call successors, (37), 3 states have call predecessors, (37), 1 states have return successors, (33), 9 states have call predecessors, (33), 9 states have call successors, (33) Word has length 73 [2024-09-25 10:40:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:02,774 INFO L225 Difference]: With dead ends: 143 [2024-09-25 10:40:02,774 INFO L226 Difference]: Without dead ends: 94 [2024-09-25 10:40:02,775 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:40:02,775 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:02,775 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 276 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:40:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-25 10:40:02,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-09-25 10:40:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-25 10:40:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-09-25 10:40:02,813 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 73 [2024-09-25 10:40:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:02,813 INFO L474 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-09-25 10:40:02,813 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 9 states have call successors, (37), 3 states have call predecessors, (37), 1 states have return successors, (33), 9 states have call predecessors, (33), 9 states have call successors, (33) [2024-09-25 10:40:02,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-09-25 10:40:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-25 10:40:02,815 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:02,815 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:02,831 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:40:03,019 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:03,020 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:03,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash 721076372, now seen corresponding path program 2 times [2024-09-25 10:40:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:03,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827870859] [2024-09-25 10:40:03,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:03,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:40:03,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695373210] [2024-09-25 10:40:03,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:40:03,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:03,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:03,048 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:40:03,049 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:40:03,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:40:03,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:40:03,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-25 10:40:03,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 28 proven. 58 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-25 10:40:03,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 28 proven. 58 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-25 10:40:11,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:11,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827870859] [2024-09-25 10:40:11,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:40:11,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695373210] [2024-09-25 10:40:11,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695373210] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:40:11,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:40:11,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-09-25 10:40:11,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785330196] [2024-09-25 10:40:11,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:40:11,909 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 10:40:11,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:11,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 10:40:11,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:40:11,913 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 10 states have call predecessors, (27), 10 states have call successors, (27) [2024-09-25 10:40:21,489 WARN L293 SmtUtils]: Spent 9.30s on a formula simplification. DAG size of input: 168 DAG size of output: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:40:24,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:40:25,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:40:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:26,758 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2024-09-25 10:40:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 10:40:26,759 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 10 states have call predecessors, (27), 10 states have call successors, (27) Word has length 87 [2024-09-25 10:40:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:26,762 INFO L225 Difference]: With dead ends: 199 [2024-09-25 10:40:26,762 INFO L226 Difference]: Without dead ends: 166 [2024-09-25 10:40:26,763 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2024-09-25 10:40:26,764 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 60 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:26,764 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 314 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-09-25 10:40:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-09-25 10:40:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2024-09-25 10:40:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 103 states have internal predecessors, (113), 51 states have call successors, (51), 16 states have call predecessors, (51), 15 states have return successors, (49), 42 states have call predecessors, (49), 49 states have call successors, (49) [2024-09-25 10:40:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 213 transitions. [2024-09-25 10:40:26,842 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 213 transitions. Word has length 87 [2024-09-25 10:40:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:26,844 INFO L474 AbstractCegarLoop]: Abstraction has 162 states and 213 transitions. [2024-09-25 10:40:26,845 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 10 states have call predecessors, (27), 10 states have call successors, (27) [2024-09-25 10:40:26,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 213 transitions. [2024-09-25 10:40:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-09-25 10:40:26,850 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:26,850 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:26,868 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:40:27,051 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:27,051 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:27,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:27,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1885445924, now seen corresponding path program 2 times [2024-09-25 10:40:27,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:27,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872092798] [2024-09-25 10:40:27,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:27,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:40:27,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334867730] [2024-09-25 10:40:27,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:40:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:27,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:27,092 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:40:27,104 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:40:27,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:40:27,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:40:27,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-09-25 10:40:27,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-25 10:40:27,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-25 10:40:29,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:29,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872092798] [2024-09-25 10:40:29,742 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:40:29,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334867730] [2024-09-25 10:40:29,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334867730] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:40:29,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:40:29,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-09-25 10:40:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495326998] [2024-09-25 10:40:29,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:40:29,743 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-25 10:40:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:29,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-25 10:40:29,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2024-09-25 10:40:29,744 INFO L87 Difference]: Start difference. First operand 162 states and 213 transitions. Second operand has 27 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 16 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2024-09-25 10:40:36,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:40:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:36,990 INFO L93 Difference]: Finished difference Result 235 states and 312 transitions. [2024-09-25 10:40:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-25 10:40:36,991 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 16 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) Word has length 98 [2024-09-25 10:40:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:36,993 INFO L225 Difference]: With dead ends: 235 [2024-09-25 10:40:36,993 INFO L226 Difference]: Without dead ends: 172 [2024-09-25 10:40:36,994 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=280, Invalid=842, Unknown=0, NotChecked=0, Total=1122 [2024-09-25 10:40:36,994 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 110 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:36,994 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 310 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 416 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-09-25 10:40:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-09-25 10:40:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 145. [2024-09-25 10:40:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 93 states have internal predecessors, (98), 42 states have call successors, (42), 17 states have call predecessors, (42), 16 states have return successors, (40), 34 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-25 10:40:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 180 transitions. [2024-09-25 10:40:37,049 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 180 transitions. Word has length 98 [2024-09-25 10:40:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:37,050 INFO L474 AbstractCegarLoop]: Abstraction has 145 states and 180 transitions. [2024-09-25 10:40:37,050 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 16 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2024-09-25 10:40:37,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 180 transitions. [2024-09-25 10:40:37,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-09-25 10:40:37,051 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:37,051 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:37,064 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-25 10:40:37,252 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:37,252 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:37,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:37,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1238144755, now seen corresponding path program 2 times [2024-09-25 10:40:37,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:37,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946836184] [2024-09-25 10:40:37,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:37,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:40:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:40:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:40:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:40:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:40:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 10:40:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 10:40:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 10:40:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:40:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 10:40:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 10:40:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-25 10:40:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-25 10:40:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-25 10:40:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,689 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-25 10:40:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-25 10:40:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-25 10:40:37,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:37,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946836184] [2024-09-25 10:40:37,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946836184] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:40:37,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918681582] [2024-09-25 10:40:37,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:40:37,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:37,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:37,698 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:40:37,700 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 10:40:37,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:40:37,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:40:37,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-25 10:40:37,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-25 10:40:37,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-25 10:40:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918681582] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:40:38,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:40:38,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 19 [2024-09-25 10:40:38,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16413156] [2024-09-25 10:40:38,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:40:38,900 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 10:40:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:38,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 10:40:38,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:40:38,901 INFO L87 Difference]: Start difference. First operand 145 states and 180 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 14 states have call successors, (52), 3 states have call predecessors, (52), 1 states have return successors, (48), 14 states have call predecessors, (48), 14 states have call successors, (48) [2024-09-25 10:40:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:39,218 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2024-09-25 10:40:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 10:40:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 14 states have call successors, (52), 3 states have call predecessors, (52), 1 states have return successors, (48), 14 states have call predecessors, (48), 14 states have call successors, (48) Word has length 103 [2024-09-25 10:40:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:39,220 INFO L225 Difference]: With dead ends: 170 [2024-09-25 10:40:39,221 INFO L226 Difference]: Without dead ends: 132 [2024-09-25 10:40:39,221 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:40:39,222 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:39,222 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 314 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:40:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-09-25 10:40:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-09-25 10:40:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 84 states have internal predecessors, (89), 36 states have call successors, (36), 17 states have call predecessors, (36), 16 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2024-09-25 10:40:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 158 transitions. [2024-09-25 10:40:39,278 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 158 transitions. Word has length 103 [2024-09-25 10:40:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:39,279 INFO L474 AbstractCegarLoop]: Abstraction has 132 states and 158 transitions. [2024-09-25 10:40:39,279 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 14 states have call successors, (52), 3 states have call predecessors, (52), 1 states have return successors, (48), 14 states have call predecessors, (48), 14 states have call successors, (48) [2024-09-25 10:40:39,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 158 transitions. [2024-09-25 10:40:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-25 10:40:39,281 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:39,281 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:39,293 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 10:40:39,482 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-25 10:40:39,482 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:39,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash -840147397, now seen corresponding path program 1 times [2024-09-25 10:40:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984651433] [2024-09-25 10:40:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:40:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:40:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:40:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:40:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:40:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 10:40:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 10:40:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 10:40:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:40:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 10:40:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 10:40:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-25 10:40:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-25 10:40:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-25 10:40:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-25 10:40:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-25 10:40:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,691 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-25 10:40:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-25 10:40:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 51 proven. 28 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-25 10:40:39,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984651433] [2024-09-25 10:40:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984651433] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:40:39,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082707121] [2024-09-25 10:40:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:39,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:39,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:39,701 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:40:39,702 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 10:40:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:39,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:40:39,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-25 10:40:39,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-25 10:40:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082707121] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:40:39,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:40:39,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 9 [2024-09-25 10:40:39,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700152007] [2024-09-25 10:40:39,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:40:40,000 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:40:40,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:40,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:40:40,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:40:40,001 INFO L87 Difference]: Start difference. First operand 132 states and 158 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 9 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2024-09-25 10:40:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:40,102 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2024-09-25 10:40:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:40:40,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 9 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 115 [2024-09-25 10:40:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:40,104 INFO L225 Difference]: With dead ends: 138 [2024-09-25 10:40:40,104 INFO L226 Difference]: Without dead ends: 131 [2024-09-25 10:40:40,104 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 262 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:40:40,105 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:40,105 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:40:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-09-25 10:40:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2024-09-25 10:40:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 81 states have internal predecessors, (86), 33 states have call successors, (33), 17 states have call predecessors, (33), 16 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2024-09-25 10:40:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2024-09-25 10:40:40,152 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 115 [2024-09-25 10:40:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:40,153 INFO L474 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2024-09-25 10:40:40,153 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 9 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2024-09-25 10:40:40,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2024-09-25 10:40:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-09-25 10:40:40,154 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:40,154 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:40,171 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-25 10:40:40,358 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-25 10:40:40,359 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:40,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:40,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1808323179, now seen corresponding path program 3 times [2024-09-25 10:40:40,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:40,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561227787] [2024-09-25 10:40:40,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:40:40,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105043641] [2024-09-25 10:40:40,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:40:40,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:40,387 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:40:40,391 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 10:40:40,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 10:40:40,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:40:40,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-25 10:40:40,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-09-25 10:40:40,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561227787] [2024-09-25 10:40:41,745 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:40:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105043641] [2024-09-25 10:40:41,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105043641] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:40:41,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:40:41,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-09-25 10:40:41,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124501819] [2024-09-25 10:40:41,746 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-25 10:40:41,746 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:40:41,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:40:41,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:40:41,746 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 10:40:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:41,877 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2024-09-25 10:40:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:40:41,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 117 [2024-09-25 10:40:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:41,879 INFO L225 Difference]: With dead ends: 133 [2024-09-25 10:40:41,879 INFO L226 Difference]: Without dead ends: 131 [2024-09-25 10:40:41,880 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:40:41,880 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:41,880 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:40:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-09-25 10:40:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-09-25 10:40:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 80 states have (on average 1.1125) internal successors, (89), 84 states have internal predecessors, (89), 33 states have call successors, (33), 18 states have call predecessors, (33), 17 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2024-09-25 10:40:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2024-09-25 10:40:41,944 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 117 [2024-09-25 10:40:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:41,945 INFO L474 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2024-09-25 10:40:41,945 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 10:40:41,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2024-09-25 10:40:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-09-25 10:40:41,947 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:41,947 INFO L216 NwaCegarLoop]: trace histogram [21, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:41,959 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-25 10:40:42,147 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-25 10:40:42,148 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:42,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash -725567613, now seen corresponding path program 3 times [2024-09-25 10:40:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:42,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103720927] [2024-09-25 10:40:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:40:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37165802] [2024-09-25 10:40:42,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:40:42,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:42,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:42,190 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:40:42,191 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-25 10:40:42,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 10:40:42,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:40:42,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 10:40:42,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 163 proven. 53 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2024-09-25 10:40:42,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-09-25 10:40:42,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103720927] [2024-09-25 10:40:42,567 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:40:42,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37165802] [2024-09-25 10:40:42,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37165802] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:40:42,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:40:42,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-09-25 10:40:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735256412] [2024-09-25 10:40:42,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:40:42,568 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 10:40:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 10:40:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:40:42,569 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2024-09-25 10:40:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:42,808 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2024-09-25 10:40:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:40:42,809 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) Word has length 128 [2024-09-25 10:40:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:42,810 INFO L225 Difference]: With dead ends: 132 [2024-09-25 10:40:42,810 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:40:42,811 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:40:42,813 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 51 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:42,814 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 120 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:40:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:40:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:40:42,814 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:40:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:40:42,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2024-09-25 10:40:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:42,815 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:40:42,815 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2024-09-25 10:40:42,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:40:42,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:40:42,818 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:40:42,835 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-25 10:40:43,022 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-25 10:40:43,026 INFO L408 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:43,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:40:45,853 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:40:45,872 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:40:45,873 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:40:45,873 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:40:45,873 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:40:45,873 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:40:45,873 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:40:45,873 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 10:40:45,873 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 10:40:45,873 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:40:45,874 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:40:45,875 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:40:45,875 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:40:45,876 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:40:45,876 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:40:45,876 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:40:45,876 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:40:45,876 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 10:40:45,876 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 10:40:45,876 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:40:45,876 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:40:45,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:40:45 BoogieIcfgContainer [2024-09-25 10:40:45,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:40:45,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:40:45,878 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:40:45,878 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:40:45,879 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:39:54" (3/4) ... [2024-09-25 10:40:45,881 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:40:45,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:40:45,940 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:40:45,940 INFO L158 Benchmark]: Toolchain (without parser) took 52565.12ms. Allocated memory was 75.5MB in the beginning and 234.9MB in the end (delta: 159.4MB). Free memory was 46.9MB in the beginning and 118.4MB in the end (delta: -71.5MB). Peak memory consumption was 88.5MB. Max. memory is 16.1GB. [2024-09-25 10:40:45,940 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory is still 29.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:40:45,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.12ms. Allocated memory is still 75.5MB. Free memory was 46.7MB in the beginning and 35.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 10:40:45,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.45ms. Allocated memory is still 75.5MB. Free memory was 35.1MB in the beginning and 34.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:40:45,941 INFO L158 Benchmark]: Boogie Preprocessor took 56.58ms. Allocated memory is still 75.5MB. Free memory was 34.0MB in the beginning and 54.2MB in the end (delta: -20.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-09-25 10:40:45,941 INFO L158 Benchmark]: RCFGBuilder took 370.91ms. Allocated memory is still 75.5MB. Free memory was 54.2MB in the beginning and 41.6MB in the end (delta: 12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 10:40:45,941 INFO L158 Benchmark]: TraceAbstraction took 51786.35ms. Allocated memory was 75.5MB in the beginning and 234.9MB in the end (delta: 159.4MB). Free memory was 40.7MB in the beginning and 120.5MB in the end (delta: -79.8MB). Peak memory consumption was 130.3MB. Max. memory is 16.1GB. [2024-09-25 10:40:45,942 INFO L158 Benchmark]: Witness Printer took 61.74ms. Allocated memory is still 234.9MB. Free memory was 120.5MB in the beginning and 118.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:40:45,943 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 54.5MB. Free memory is still 29.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.12ms. Allocated memory is still 75.5MB. Free memory was 46.7MB in the beginning and 35.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.45ms. Allocated memory is still 75.5MB. Free memory was 35.1MB in the beginning and 34.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.58ms. Allocated memory is still 75.5MB. Free memory was 34.0MB in the beginning and 54.2MB in the end (delta: -20.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.91ms. Allocated memory is still 75.5MB. Free memory was 54.2MB in the beginning and 41.6MB in the end (delta: 12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 51786.35ms. Allocated memory was 75.5MB in the beginning and 234.9MB in the end (delta: 159.4MB). Free memory was 40.7MB in the beginning and 120.5MB in the end (delta: -79.8MB). Peak memory consumption was 130.3MB. Max. memory is 16.1GB. * Witness Printer took 61.74ms. Allocated memory is still 234.9MB. Free memory was 120.5MB in the beginning and 118.4MB 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: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - 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: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.9s, OverallIterations: 15, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 25.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 11.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 2544 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2115 mSDsCounter, 447 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2308 IncrementalHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 447 mSolverCounterUnsat, 429 mSDtfsCounter, 2308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1890 GetRequests, 1683 SyntacticMatches, 15 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=10, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 79 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 1928 NumberOfCodeBlocks, 1801 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2028 ConstructedInterpolants, 0 QuantifiedInterpolants, 20692 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2125 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 8825/9435 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((A == r) && (((long long) A + d) == ((long long) p + r))) && (8 <= p)) && (q == 0)) && (B == 1)) || ((((((A == r) && (p == 2)) && (1 <= r)) && (d == 2)) && (q == 0)) && (B == 1))) || ((((((A == r) && (d == 4)) && (2 <= r)) && (q == 0)) && (B == 1)) && (p == 4))) || (((((A == r) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1))) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((A == ((long long) q + r)) && (d == p)) && (1 <= p)) && (B == 1)) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:40:46,022 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