./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e89b4ab54b22145b4041cfb458aca993f2d791ac86940dcd03d48a90a5273393 --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:52:07,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:52:07,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:52:07,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:52:07,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:52:07,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:52:07,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:52:07,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:52:07,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:52:07,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:52:07,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:52:07,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:52:07,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:52:07,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:52:07,494 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:52:07,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:52:07,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:52:07,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:52:07,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:52:07,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:52:07,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:52:07,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:52:07,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:52:07,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:52:07,499 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:52:07,499 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:52:07,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:52:07,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:52:07,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:52:07,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:52:07,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:52:07,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:52:07,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:52:07,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:52:07,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:52:07,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:52:07,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:52:07,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:52:07,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:52:07,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:52:07,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:52:07,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:52:07,505 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 -> e89b4ab54b22145b4041cfb458aca993f2d791ac86940dcd03d48a90a5273393 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:52:07,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:52:07,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:52:07,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:52:07,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:52:07,847 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:52:07,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound2.c [2024-09-25 10:52:09,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:52:09,587 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:52:09,587 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound2.c [2024-09-25 10:52:09,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8a293b3f3/4a183bfb427d4296bf273a4e73d2efc9/FLAG4552fd67b [2024-09-25 10:52:09,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8a293b3f3/4a183bfb427d4296bf273a4e73d2efc9 [2024-09-25 10:52:09,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:52:09,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:52:09,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:52:09,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:52:09,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:52:09,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d78e746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09, skipping insertion in model container [2024-09-25 10:52:09,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:52:09,818 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound2.c[489,502] [2024-09-25 10:52:09,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:52:09,856 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:52:09,867 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound2.c[489,502] [2024-09-25 10:52:09,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:52:09,902 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:52:09,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09 WrapperNode [2024-09-25 10:52:09,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:52:09,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:52:09,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:52:09,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:52:09,910 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:52:09" (1/1) ... [2024-09-25 10:52:09,916 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:52:09" (1/1) ... [2024-09-25 10:52:09,921 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:52:09,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:52:09,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:52:09,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:52:09,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:52:09,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,943 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:52:09,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:52:09,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:52:09,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:52:09,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:52:09,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (1/1) ... [2024-09-25 10:52:09,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:52:09,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:09,985 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:52:09,988 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:52:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:52:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:52:10,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:52:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:52:10,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:52:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:52:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:52:10,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:52:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:52:10,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:52:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:52:10,033 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:52:10,095 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:52:10,097 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:52:10,277 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:52:10,279 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:52:10,305 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:52:10,307 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:52:10,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:52:10 BoogieIcfgContainer [2024-09-25 10:52:10,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:52:10,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:52:10,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:52:10,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:52:10,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:52:09" (1/3) ... [2024-09-25 10:52:10,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2969f8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:52:10, skipping insertion in model container [2024-09-25 10:52:10,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:52:09" (2/3) ... [2024-09-25 10:52:10,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2969f8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:52:10, skipping insertion in model container [2024-09-25 10:52:10,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:52:10" (3/3) ... [2024-09-25 10:52:10,316 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound2.c [2024-09-25 10:52:10,333 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:52:10,333 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:52:10,391 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:52:10,397 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;@6dc41823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:52:10,398 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:52:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 10:52:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 10:52:10,409 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:10,410 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:10,411 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:10,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:10,416 INFO L85 PathProgramCache]: Analyzing trace with hash 963610160, now seen corresponding path program 1 times [2024-09-25 10:52:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:10,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923366235] [2024-09-25 10:52:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:10,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:52:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:10,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:52:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:10,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:52:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:10,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:52:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:10,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:52:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:52:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:10,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923366235] [2024-09-25 10:52:10,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923366235] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:52:10,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:52:10,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:52:10,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274392086] [2024-09-25 10:52:10,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:52:10,600 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:52:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:10,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:52:10,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:52:10,621 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:52:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:10,662 INFO L93 Difference]: Finished difference Result 64 states and 102 transitions. [2024-09-25 10:52:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:52:10,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-25 10:52:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:10,671 INFO L225 Difference]: With dead ends: 64 [2024-09-25 10:52:10,672 INFO L226 Difference]: Without dead ends: 31 [2024-09-25 10:52:10,676 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:52:10,680 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:10,681 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:52:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-25 10:52:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-25 10:52:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-25 10:52:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-09-25 10:52:10,714 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 32 [2024-09-25 10:52:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:10,714 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-09-25 10:52:10,715 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:52:10,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-09-25 10:52:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 10:52:10,717 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:10,717 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:10,717 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:52:10,718 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:10,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash -914175556, now seen corresponding path program 1 times [2024-09-25 10:52:10,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:10,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28036886] [2024-09-25 10:52:10,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:52:10,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1642937834] [2024-09-25 10:52:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:10,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:10,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:10,784 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:52:10,786 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:52:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:10,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:52:10,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:52:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:52:11,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:52:11,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28036886] [2024-09-25 10:52:11,038 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:52:11,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642937834] [2024-09-25 10:52:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642937834] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:52:11,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:52:11,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:52:11,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602685732] [2024-09-25 10:52:11,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:52:11,042 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:52:11,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:52:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:52:11,043 INFO L87 Difference]: Start difference. First operand 31 states and 41 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-25 10:52:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:11,128 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2024-09-25 10:52:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:52:11,129 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2024-09-25 10:52:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:11,130 INFO L225 Difference]: With dead ends: 47 [2024-09-25 10:52:11,130 INFO L226 Difference]: Without dead ends: 45 [2024-09-25 10:52:11,131 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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:52:11,132 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:11,132 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:52:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-25 10:52:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-09-25 10:52:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-25 10:52:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2024-09-25 10:52:11,151 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 32 [2024-09-25 10:52:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:11,152 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2024-09-25 10:52:11,152 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-25 10:52:11,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2024-09-25 10:52:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 10:52:11,157 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:11,158 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:11,174 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:52:11,358 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:11,359 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:11,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash 737940505, now seen corresponding path program 1 times [2024-09-25 10:52:11,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:11,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487084546] [2024-09-25 10:52:11,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:11,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:52:11,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125618038] [2024-09-25 10:52:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:11,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:11,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:11,390 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:52:11,391 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:52:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:11,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:52:11,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:52:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:52:11,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:52:11,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:11,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487084546] [2024-09-25 10:52:11,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:52:11,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125618038] [2024-09-25 10:52:11,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125618038] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:52:11,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:52:11,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:52:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499839226] [2024-09-25 10:52:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:52:11,510 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:52:11,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:11,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:52:11,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:52:11,514 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-25 10:52:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:11,592 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-25 10:52:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:52:11,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-09-25 10:52:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:11,594 INFO L225 Difference]: With dead ends: 51 [2024-09-25 10:52:11,594 INFO L226 Difference]: Without dead ends: 49 [2024-09-25 10:52:11,594 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:52:11,595 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:11,596 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:52:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-25 10:52:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-09-25 10:52:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-25 10:52:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-09-25 10:52:11,618 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 37 [2024-09-25 10:52:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:11,619 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-09-25 10:52:11,619 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-25 10:52:11,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-09-25 10:52:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-25 10:52:11,622 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:11,623 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:11,635 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:52:11,823 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:11,823 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:11,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1385223068, now seen corresponding path program 1 times [2024-09-25 10:52:11,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:11,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682655245] [2024-09-25 10:52:11,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:11,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:52:11,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919925944] [2024-09-25 10:52:11,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:11,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:11,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:11,873 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:52:11,874 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:52:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:11,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:52:11,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:52:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 10:52:12,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:52:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682655245] [2024-09-25 10:52:12,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:52:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919925944] [2024-09-25 10:52:12,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919925944] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:52:12,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:52:12,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:52:12,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771960385] [2024-09-25 10:52:12,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:52:12,012 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:52:12,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:12,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:52:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:52:12,015 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:52:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:12,081 INFO L93 Difference]: Finished difference Result 73 states and 104 transitions. [2024-09-25 10:52:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:52:12,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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 42 [2024-09-25 10:52:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:12,084 INFO L225 Difference]: With dead ends: 73 [2024-09-25 10:52:12,084 INFO L226 Difference]: Without dead ends: 69 [2024-09-25 10:52:12,085 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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:52:12,086 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 130 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:52:12,086 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 130 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:52:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-25 10:52:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-09-25 10:52:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-25 10:52:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-09-25 10:52:12,103 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 42 [2024-09-25 10:52:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:12,104 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-09-25 10:52:12,104 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:52:12,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-09-25 10:52:12,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-25 10:52:12,105 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:12,106 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:12,122 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:52:12,309 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:12,310 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:12,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1071635405, now seen corresponding path program 1 times [2024-09-25 10:52:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:12,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026188479] [2024-09-25 10:52:12,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:12,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:12,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:52:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:12,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:52:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:12,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:52:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:12,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:52:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:12,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:52:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:12,545 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:52:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:12,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 10:52:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:12,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 10:52:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:52:12,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:12,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026188479] [2024-09-25 10:52:12,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026188479] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:52:12,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:52:12,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:52:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724001902] [2024-09-25 10:52:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:52:12,566 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:52:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:12,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:52:12,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:52:12,567 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-25 10:52:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:12,622 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2024-09-25 10:52:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:52:12,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 48 [2024-09-25 10:52:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:12,625 INFO L225 Difference]: With dead ends: 75 [2024-09-25 10:52:12,626 INFO L226 Difference]: Without dead ends: 73 [2024-09-25 10:52:12,627 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:52:12,627 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:12,628 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 140 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:52:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-25 10:52:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-09-25 10:52:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-25 10:52:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2024-09-25 10:52:12,655 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 48 [2024-09-25 10:52:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:12,655 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2024-09-25 10:52:12,655 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-25 10:52:12,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2024-09-25 10:52:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-25 10:52:12,657 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:12,657 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:12,657 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:52:12,657 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:12,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1501538128, now seen corresponding path program 1 times [2024-09-25 10:52:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:12,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614115672] [2024-09-25 10:52:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:12,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:52:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577509877] [2024-09-25 10:52:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:12,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:12,703 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:52:12,704 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:52:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:12,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 10:52:12,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:52:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-09-25 10:52:12,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:52:12,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:12,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614115672] [2024-09-25 10:52:12,867 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:52:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577509877] [2024-09-25 10:52:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577509877] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:52:12,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:52:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:52:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484941624] [2024-09-25 10:52:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:52:12,868 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:52:12,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:12,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:52:12,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:52:12,871 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 10:52:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:12,936 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2024-09-25 10:52:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:52:12,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2024-09-25 10:52:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:12,938 INFO L225 Difference]: With dead ends: 83 [2024-09-25 10:52:12,938 INFO L226 Difference]: Without dead ends: 80 [2024-09-25 10:52:12,939 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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:52:12,939 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:12,940 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 132 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:52:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-25 10:52:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-09-25 10:52:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-25 10:52:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-09-25 10:52:12,957 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 50 [2024-09-25 10:52:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:12,957 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-09-25 10:52:12,957 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 10:52:12,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-09-25 10:52:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-25 10:52:12,961 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:12,961 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:12,978 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:52:13,164 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:13,165 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:13,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:13,165 INFO L85 PathProgramCache]: Analyzing trace with hash 789508930, now seen corresponding path program 1 times [2024-09-25 10:52:13,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:13,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560259979] [2024-09-25 10:52:13,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:13,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:52:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:52:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:52:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:52:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:52:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:52:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 10:52:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,495 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 10:52:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-25 10:52:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-09-25 10:52:13,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:13,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560259979] [2024-09-25 10:52:13,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560259979] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:52:13,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165478944] [2024-09-25 10:52:13,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:13,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:13,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:13,528 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:52:13,530 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:52:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:13,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 10:52:13,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:52:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-09-25 10:52:13,693 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:52:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165478944] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:52:13,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:52:13,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-09-25 10:52:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759434913] [2024-09-25 10:52:13,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:52:13,695 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:52:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:13,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:52:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:52:13,696 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-25 10:52:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:13,796 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2024-09-25 10:52:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:52:13,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 53 [2024-09-25 10:52:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:13,798 INFO L225 Difference]: With dead ends: 91 [2024-09-25 10:52:13,798 INFO L226 Difference]: Without dead ends: 87 [2024-09-25 10:52:13,798 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:52:13,799 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:13,799 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 157 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:52:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-25 10:52:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-09-25 10:52:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 50 states have internal predecessors, (55), 27 states have call successors, (27), 12 states have call predecessors, (27), 11 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-25 10:52:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2024-09-25 10:52:13,821 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 53 [2024-09-25 10:52:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:13,822 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2024-09-25 10:52:13,824 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-25 10:52:13,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2024-09-25 10:52:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-25 10:52:13,825 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:13,826 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:13,843 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:52:14,026 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:52:14,027 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:14,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1427018501, now seen corresponding path program 2 times [2024-09-25 10:52:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097222172] [2024-09-25 10:52:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:52:14,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912733712] [2024-09-25 10:52:14,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:52:14,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:14,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:14,055 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:52:14,057 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:52:14,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:52:14,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:52:14,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-25 10:52:14,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:52:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-25 10:52:14,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:52:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-09-25 10:52:15,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:15,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097222172] [2024-09-25 10:52:15,112 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:52:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912733712] [2024-09-25 10:52:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912733712] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:52:15,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:52:15,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2024-09-25 10:52:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785820633] [2024-09-25 10:52:15,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:52:15,114 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 10:52:15,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:15,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 10:52:15,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:52:15,115 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2024-09-25 10:52:19,596 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:52:19,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:19,746 INFO L93 Difference]: Finished difference Result 154 states and 201 transitions. [2024-09-25 10:52:19,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 10:52:19,747 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 55 [2024-09-25 10:52:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:19,748 INFO L225 Difference]: With dead ends: 154 [2024-09-25 10:52:19,749 INFO L226 Difference]: Without dead ends: 118 [2024-09-25 10:52:19,749 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:52:19,750 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 74 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:19,751 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 238 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 284 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-09-25 10:52:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-09-25 10:52:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 94. [2024-09-25 10:52:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-25 10:52:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-09-25 10:52:19,790 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 55 [2024-09-25 10:52:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:19,791 INFO L474 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-09-25 10:52:19,791 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2024-09-25 10:52:19,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-09-25 10:52:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-25 10:52:19,794 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:19,794 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:19,812 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 10:52:19,998 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:19,999 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:19,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1563984878, now seen corresponding path program 1 times [2024-09-25 10:52:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710366716] [2024-09-25 10:52:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:52:20,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205685799] [2024-09-25 10:52:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:20,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:20,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:20,020 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:52:20,026 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:52:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:20,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 10:52:20,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:52:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-25 10:52:20,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:52:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-25 10:52:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:20,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710366716] [2024-09-25 10:52:20,421 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:52:20,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205685799] [2024-09-25 10:52:20,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205685799] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:52:20,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:52:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-09-25 10:52:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036310190] [2024-09-25 10:52:20,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:52:20,422 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:52:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:20,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:52:20,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:52:20,423 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2024-09-25 10:52:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:21,067 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2024-09-25 10:52:21,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:52:21,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 60 [2024-09-25 10:52:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:21,069 INFO L225 Difference]: With dead ends: 119 [2024-09-25 10:52:21,069 INFO L226 Difference]: Without dead ends: 101 [2024-09-25 10:52:21,070 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:52:21,071 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:21,071 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 195 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:52:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-25 10:52:21,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2024-09-25 10:52:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-25 10:52:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-09-25 10:52:21,114 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 60 [2024-09-25 10:52:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:21,116 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-09-25 10:52:21,116 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2024-09-25 10:52:21,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-09-25 10:52:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-25 10:52:21,117 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:21,118 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:21,134 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:52:21,318 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:21,318 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:21,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1657370914, now seen corresponding path program 1 times [2024-09-25 10:52:21,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:21,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28845212] [2024-09-25 10:52:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:52:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:52:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:52:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:52:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:52:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:52:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,490 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 10:52:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 10:52:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-25 10:52:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,502 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 10:52:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-25 10:52:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-09-25 10:52:21,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28845212] [2024-09-25 10:52:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28845212] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:52:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183378193] [2024-09-25 10:52:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:21,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:21,512 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:52:21,513 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:52:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:21,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:52:21,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:52:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-09-25 10:52:21,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:52:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-09-25 10:52:21,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183378193] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:52:21,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:52:21,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2024-09-25 10:52:21,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836381022] [2024-09-25 10:52:21,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:52:21,773 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 10:52:21,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 10:52:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:52:21,774 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 9 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2024-09-25 10:52:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:21,944 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-09-25 10:52:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:52:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 9 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 68 [2024-09-25 10:52:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:21,948 INFO L225 Difference]: With dead ends: 113 [2024-09-25 10:52:21,948 INFO L226 Difference]: Without dead ends: 85 [2024-09-25 10:52:21,951 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 150 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:52:21,952 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:21,952 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 224 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:52:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-09-25 10:52:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-09-25 10:52:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 51 states have internal predecessors, (53), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-25 10:52:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-09-25 10:52:21,980 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 68 [2024-09-25 10:52:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:21,981 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-09-25 10:52:21,982 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 9 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2024-09-25 10:52:21,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-09-25 10:52:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-25 10:52:21,983 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:21,983 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:22,001 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:52:22,183 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:22,184 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:22,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:22,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1466099106, now seen corresponding path program 2 times [2024-09-25 10:52:22,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:22,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934069152] [2024-09-25 10:52:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:22,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:52:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:52:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:52:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:52:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:52:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:52:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 10:52:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 10:52:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,416 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-25 10:52:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 10:52:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-25 10:52:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-09-25 10:52:22,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:22,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934069152] [2024-09-25 10:52:22,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934069152] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:52:22,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078346182] [2024-09-25 10:52:22,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:52:22,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:22,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:22,431 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:52:22,432 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:52:22,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:52:22,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:52:22,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:52:22,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:52:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-09-25 10:52:22,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:52:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-09-25 10:52:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078346182] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:52:22,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:52:22,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-09-25 10:52:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969790126] [2024-09-25 10:52:22,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:52:22,701 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 10:52:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:22,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 10:52:22,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:52:22,702 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2024-09-25 10:52:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:22,880 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2024-09-25 10:52:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:52:22,880 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 68 [2024-09-25 10:52:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:22,881 INFO L225 Difference]: With dead ends: 103 [2024-09-25 10:52:22,881 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 10:52:22,881 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:52:22,882 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:22,882 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 280 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:52:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 10:52:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-09-25 10:52:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.0) internal successors, (36), 36 states have internal predecessors, (36), 14 states have call successors, (14), 11 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:52:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2024-09-25 10:52:22,891 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 68 [2024-09-25 10:52:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:22,891 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2024-09-25 10:52:22,892 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2024-09-25 10:52:22,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2024-09-25 10:52:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-09-25 10:52:22,893 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:52:22,893 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:22,909 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:52:23,093 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 10:52:23,094 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:52:23,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash -335668690, now seen corresponding path program 1 times [2024-09-25 10:52:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:52:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282556622] [2024-09-25 10:52:23,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:23,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:52:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:52:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:52:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,234 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:52:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:52:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:52:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:52:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 10:52:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,242 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 10:52:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-25 10:52:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 10:52:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,263 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-25 10:52:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 10:52:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-09-25 10:52:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:52:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282556622] [2024-09-25 10:52:23,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282556622] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:52:23,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831304512] [2024-09-25 10:52:23,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:52:23,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:52:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:52:23,277 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:52:23,278 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:52:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:52:23,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:52:23,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:52:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-09-25 10:52:23,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:52:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-09-25 10:52:23,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831304512] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:52:23,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:52:23,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2024-09-25 10:52:23,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914011755] [2024-09-25 10:52:23,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:52:23,453 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:52:23,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:52:23,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:52:23,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:52:23,454 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-25 10:52:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:52:23,590 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2024-09-25 10:52:23,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:52:23,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 71 [2024-09-25 10:52:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:52:23,592 INFO L225 Difference]: With dead ends: 60 [2024-09-25 10:52:23,592 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:52:23,593 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:52:23,593 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:52:23,594 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 144 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:52:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:52:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:52:23,594 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:52:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:52:23,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2024-09-25 10:52:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:52:23,594 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:52:23,595 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-25 10:52:23,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:52:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:52:23,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:52:23,599 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:52:23,617 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:52:23,800 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-25 10:52:23,803 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:52:23,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:52:25,359 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:52:25,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:52:25,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:52:25,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:52:25,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:52:25,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:52:25,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:52:25,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:52:25,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:52:25,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:52:25,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:52:25,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:52:25,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:52:25,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:52:25,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:52:25,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:52:25,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:52:25,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:52:25,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:52:25,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:52:25,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:52:25,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:52:25,382 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:52:25,382 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:52:25,382 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:52:25,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:52:25 BoogieIcfgContainer [2024-09-25 10:52:25,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:52:25,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:52:25,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:52:25,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:52:25,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:52:10" (3/4) ... [2024-09-25 10:52:25,385 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:52:25,430 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:52:25,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:52:25,431 INFO L158 Benchmark]: Toolchain (without parser) took 15815.70ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 44.5MB in the beginning and 58.4MB in the end (delta: -13.9MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2024-09-25 10:52:25,431 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:52:25,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.97ms. Allocated memory is still 77.6MB. Free memory was 44.2MB in the beginning and 52.5MB in the end (delta: -8.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-09-25 10:52:25,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.97ms. Allocated memory is still 77.6MB. Free memory was 52.5MB in the beginning and 51.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:52:25,432 INFO L158 Benchmark]: Boogie Preprocessor took 31.49ms. Allocated memory is still 77.6MB. Free memory was 51.3MB in the beginning and 49.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:52:25,432 INFO L158 Benchmark]: RCFGBuilder took 353.88ms. Allocated memory is still 77.6MB. Free memory was 49.3MB in the beginning and 36.5MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-25 10:52:25,433 INFO L158 Benchmark]: TraceAbstraction took 15072.49ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 35.9MB in the beginning and 61.5MB in the end (delta: -25.7MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2024-09-25 10:52:25,433 INFO L158 Benchmark]: Witness Printer took 47.58ms. Allocated memory is still 94.4MB. Free memory was 60.5MB in the beginning and 58.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:52:25,434 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.17ms. Allocated memory is still 54.5MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.97ms. Allocated memory is still 77.6MB. Free memory was 44.2MB in the beginning and 52.5MB in the end (delta: -8.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.97ms. Allocated memory is still 77.6MB. Free memory was 52.5MB in the beginning and 51.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.49ms. Allocated memory is still 77.6MB. Free memory was 51.3MB in the beginning and 49.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 353.88ms. Allocated memory is still 77.6MB. Free memory was 49.3MB in the beginning and 36.5MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15072.49ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 35.9MB in the beginning and 61.5MB in the end (delta: -25.7MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * Witness Printer took 47.58ms. Allocated memory is still 94.4MB. Free memory was 60.5MB in the beginning and 58.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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 12, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 1943 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1531 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1014 IncrementalHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 412 mSDtfsCounter, 1014 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 912 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=8, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1152 NumberOfCodeBlocks, 1152 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 3143 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1318 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 1438/1595 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: 35]: Loop Invariant Derived loop invariant: ((((((((((((r == 0) && (y <= 2)) && (s == 1)) && (0 <= x)) && (b == y)) && (q == 0)) && (1 <= y)) && (a == x)) && (x <= 2)) && (p == 1)) || (((((((((((__int128) a + ((long long) y * 2)) == ((__int128) b + x)) && (((__int128) r + 1) == 0)) && (s == 1)) && (1 <= a)) && (b == y)) && (q == 0)) && (1 <= y)) && (x <= 2)) && (p == 1))) || ((((((((((r == 0) && (a <= 1)) && (b == (((__int128) q * x) + ((__int128) y * s)))) && (y <= 2)) && (s == 1)) && (0 <= x)) && (1 <= b)) && (1 <= y)) && (a == x)) && (p == 1))) - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 10]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:52:25,454 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE