./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.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 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 09:27:17,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 09:27:17,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 09:27:17,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 09:27:17,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 09:27:17,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 09:27:17,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 09:27:17,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 09:27:17,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 09:27:17,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 09:27:17,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 09:27:17,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 09:27:17,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 09:27:17,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 09:27:17,880 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 09:27:17,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 09:27:17,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 09:27:17,882 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 09:27:17,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 09:27:17,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 09:27:17,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 09:27:17,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 09:27:17,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 09:27:17,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 09:27:17,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 09:27:17,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 09:27:17,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 09:27:17,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 09:27:17,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 09:27:17,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 09:27:17,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 09:27:17,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 09:27:17,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 09:27:17,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 09:27:17,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 09:27:17,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 09:27:17,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 09:27:17,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 09:27:17,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 09:27:17,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 09:27:17,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 09:27:17,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 09:27:17,888 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 -> 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 09:27:18,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 09:27:18,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 09:27:18,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 09:27:18,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 09:27:18,127 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 09:27:18,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2024-09-13 09:27:19,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 09:27:19,502 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 09:27:19,503 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2024-09-13 09:27:19,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5dbbcdf8d/0819172957d042c2824388296a008129/FLAG957c53dbe [2024-09-13 09:27:19,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5dbbcdf8d/0819172957d042c2824388296a008129 [2024-09-13 09:27:19,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 09:27:19,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 09:27:19,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 09:27:19,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 09:27:19,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 09:27:19,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e286269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19, skipping insertion in model container [2024-09-13 09:27:19,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 09:27:19,683 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2024-09-13 09:27:19,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 09:27:19,707 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 09:27:19,716 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2024-09-13 09:27:19,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 09:27:19,733 INFO L204 MainTranslator]: Completed translation [2024-09-13 09:27:19,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19 WrapperNode [2024-09-13 09:27:19,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 09:27:19,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 09:27:19,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 09:27:19,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 09:27:19,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,748 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 09:27:19,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 09:27:19,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 09:27:19,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 09:27:19,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 09:27:19,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,767 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-13 09:27:19,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 09:27:19,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 09:27:19,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 09:27:19,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 09:27:19,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (1/1) ... [2024-09-13 09:27:19,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 09:27:19,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:27:19,802 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-13 09:27:19,804 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-13 09:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 09:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 09:27:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 09:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 09:27:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 09:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 09:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 09:27:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 09:27:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 09:27:19,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 09:27:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 09:27:19,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 09:27:19,893 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 09:27:19,894 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 09:27:20,058 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 09:27:20,058 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 09:27:20,077 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 09:27:20,077 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 09:27:20,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:27:20 BoogieIcfgContainer [2024-09-13 09:27:20,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 09:27:20,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 09:27:20,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 09:27:20,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 09:27:20,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 09:27:19" (1/3) ... [2024-09-13 09:27:20,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309b4a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 09:27:20, skipping insertion in model container [2024-09-13 09:27:20,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:27:19" (2/3) ... [2024-09-13 09:27:20,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309b4a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 09:27:20, skipping insertion in model container [2024-09-13 09:27:20,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:27:20" (3/3) ... [2024-09-13 09:27:20,094 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2024-09-13 09:27:20,121 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 09:27:20,121 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 09:27:20,165 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 09:27:20,172 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;@73b7b6e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 09:27:20,173 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 09:27:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-13 09:27:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 09:27:20,184 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:20,185 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:20,186 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:20,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:20,190 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-13 09:27:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:20,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506131320] [2024-09-13 09:27:20,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:20,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:27:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:27:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 09:27:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 09:27:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 09:27:20,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:20,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506131320] [2024-09-13 09:27:20,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506131320] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:27:20,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:27:20,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 09:27:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502157273] [2024-09-13 09:27:20,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:27:20,357 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 09:27:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:20,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 09:27:20,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 09:27:20,374 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 09:27:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:20,396 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-13 09:27:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 09:27:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-13 09:27:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:20,409 INFO L225 Difference]: With dead ends: 66 [2024-09-13 09:27:20,409 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 09:27:20,411 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 09:27:20,414 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:20,414 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:27:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 09:27:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 09:27:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 09:27:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-13 09:27:20,444 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-13 09:27:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:20,444 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-13 09:27:20,444 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 09:27:20,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-13 09:27:20,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 09:27:20,446 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:20,446 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:20,447 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 09:27:20,447 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:20,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-13 09:27:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:20,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707828322] [2024-09-13 09:27:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:27:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:27:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 09:27:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 09:27:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 09:27:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:20,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707828322] [2024-09-13 09:27:20,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707828322] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:27:20,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:27:20,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:27:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804316481] [2024-09-13 09:27:20,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:27:20,693 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:27:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:20,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:27:20,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:27:20,693 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 09:27:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:20,747 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-13 09:27:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:27:20,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-13 09:27:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:20,749 INFO L225 Difference]: With dead ends: 45 [2024-09-13 09:27:20,750 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 09:27:20,750 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:27:20,752 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:20,754 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:27:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 09:27:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-13 09:27:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 09:27:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-13 09:27:20,762 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-13 09:27:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:20,763 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-13 09:27:20,763 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 09:27:20,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-13 09:27:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 09:27:20,764 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:20,764 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:20,764 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 09:27:20,764 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:20,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-13 09:27:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012866043] [2024-09-13 09:27:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:27:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,888 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:27:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 09:27:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 09:27:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 09:27:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 09:27:20,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012866043] [2024-09-13 09:27:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012866043] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:27:20,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:27:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:27:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199160264] [2024-09-13 09:27:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:27:20,907 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:27:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:20,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:27:20,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:27:20,908 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 09:27:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:20,991 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-13 09:27:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:27:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-13 09:27:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:20,993 INFO L225 Difference]: With dead ends: 49 [2024-09-13 09:27:20,993 INFO L226 Difference]: Without dead ends: 47 [2024-09-13 09:27:20,993 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:27:20,994 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:20,994 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:27:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-13 09:27:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-13 09:27:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 09:27:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-13 09:27:21,009 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-13 09:27:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:21,010 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-13 09:27:21,010 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 09:27:21,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-13 09:27:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 09:27:21,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:21,016 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:21,016 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 09:27:21,016 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:21,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-13 09:27:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:21,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314866914] [2024-09-13 09:27:21,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:21,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:27:21,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863910828] [2024-09-13 09:27:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:21,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:21,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:27:21,053 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-13 09:27:21,054 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-13 09:27:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:21,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 09:27:21,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:27:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 09:27:21,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 09:27:21,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:21,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314866914] [2024-09-13 09:27:21,196 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:27:21,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863910828] [2024-09-13 09:27:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863910828] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:27:21,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:27:21,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:27:21,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477143949] [2024-09-13 09:27:21,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:27:21,197 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:27:21,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:21,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:27:21,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:27:21,198 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 09:27:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:21,260 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-13 09:27:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:27:21,261 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-13 09:27:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:21,263 INFO L225 Difference]: With dead ends: 66 [2024-09-13 09:27:21,263 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 09:27:21,264 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-13 09:27:21,264 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:21,265 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:27:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 09:27:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-13 09:27:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-13 09:27:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-13 09:27:21,292 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-13 09:27:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:21,293 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-13 09:27:21,293 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-13 09:27:21,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-13 09:27:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-13 09:27:21,295 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:21,295 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:21,313 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 09:27:21,495 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:21,496 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:21,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:21,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-13 09:27:21,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:21,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112428401] [2024-09-13 09:27:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:21,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:27:21,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [466168765] [2024-09-13 09:27:21,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:21,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:21,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:27:21,527 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-13 09:27:21,530 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-13 09:27:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:21,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 09:27:21,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:27:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 09:27:21,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:27:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 09:27:21,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112428401] [2024-09-13 09:27:21,836 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:27:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466168765] [2024-09-13 09:27:21,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466168765] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:27:21,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 09:27:21,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-13 09:27:21,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489246611] [2024-09-13 09:27:21,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 09:27:21,837 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 09:27:21,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:21,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 09:27:21,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-13 09:27:21,837 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 09:27:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:21,952 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-09-13 09:27:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 09:27:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-09-13 09:27:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:21,955 INFO L225 Difference]: With dead ends: 68 [2024-09-13 09:27:21,955 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 09:27:21,955 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-13 09:27:21,956 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:21,956 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:27:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 09:27:21,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-09-13 09:27:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 09:27:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-09-13 09:27:21,973 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 44 [2024-09-13 09:27:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:21,973 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-09-13 09:27:21,973 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 09:27:21,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-09-13 09:27:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 09:27:21,974 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:21,975 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:21,987 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-13 09:27:22,175 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:22,176 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:22,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:22,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-13 09:27:22,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:22,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132994852] [2024-09-13 09:27:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:22,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:27:22,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077192922] [2024-09-13 09:27:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:22,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:27:22,203 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-13 09:27:22,204 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-13 09:27:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 09:27:22,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:27:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-13 09:27:22,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:27:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-13 09:27:22,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:22,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132994852] [2024-09-13 09:27:22,477 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:27:22,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077192922] [2024-09-13 09:27:22,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077192922] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 09:27:22,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 09:27:22,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-09-13 09:27:22,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904482962] [2024-09-13 09:27:22,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:27:22,478 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:27:22,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:22,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:27:22,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-13 09:27:22,479 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-13 09:27:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:22,528 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-09-13 09:27:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:27:22,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-09-13 09:27:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:22,531 INFO L225 Difference]: With dead ends: 73 [2024-09-13 09:27:22,531 INFO L226 Difference]: Without dead ends: 71 [2024-09-13 09:27:22,532 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-13 09:27:22,532 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:22,532 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:27:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-13 09:27:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-13 09:27:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-13 09:27:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-09-13 09:27:22,556 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2024-09-13 09:27:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:22,557 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-09-13 09:27:22,557 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-13 09:27:22,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-09-13 09:27:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-13 09:27:22,560 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:22,560 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:22,572 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 09:27:22,760 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 09:27:22,761 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:22,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash 515743006, now seen corresponding path program 1 times [2024-09-13 09:27:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:22,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068496210] [2024-09-13 09:27:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:27:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:27:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 09:27:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 09:27:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 09:27:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 09:27:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 09:27:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 09:27:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 09:27:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-13 09:27:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 09:27:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068496210] [2024-09-13 09:27:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068496210] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:27:22,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:27:22,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:27:22,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605834231] [2024-09-13 09:27:22,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:27:22,867 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:27:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:22,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:27:22,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:27:22,868 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 09:27:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:22,909 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-09-13 09:27:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:27:22,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2024-09-13 09:27:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:22,911 INFO L225 Difference]: With dead ends: 78 [2024-09-13 09:27:22,911 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 09:27:22,911 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:27:22,912 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:22,912 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:27:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 09:27:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-13 09:27:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 09:27:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-09-13 09:27:22,931 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2024-09-13 09:27:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:22,931 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-09-13 09:27:22,932 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 09:27:22,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-09-13 09:27:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-13 09:27:22,934 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:22,934 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:22,934 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 09:27:22,934 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:22,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:22,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-13 09:27:22,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:22,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889586169] [2024-09-13 09:27:22,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:22,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:27:22,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740110508] [2024-09-13 09:27:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:22,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:22,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:27:22,967 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-13 09:27:22,969 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-13 09:27:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:23,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-13 09:27:23,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:27:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-09-13 09:27:23,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:27:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 09:27:24,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:24,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889586169] [2024-09-13 09:27:24,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:27:24,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740110508] [2024-09-13 09:27:24,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740110508] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:27:24,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 09:27:24,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-13 09:27:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668150466] [2024-09-13 09:27:24,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 09:27:24,680 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-13 09:27:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:24,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-13 09:27:24,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-09-13 09:27:24,681 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 10 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2024-09-13 09:27:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:25,044 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2024-09-13 09:27:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-13 09:27:25,044 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 10 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 74 [2024-09-13 09:27:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:25,046 INFO L225 Difference]: With dead ends: 122 [2024-09-13 09:27:25,046 INFO L226 Difference]: Without dead ends: 99 [2024-09-13 09:27:25,046 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-09-13 09:27:25,047 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:25,047 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 329 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 09:27:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-13 09:27:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2024-09-13 09:27:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 57 states have internal predecessors, (61), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 09:27:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2024-09-13 09:27:25,065 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 74 [2024-09-13 09:27:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:25,065 INFO L474 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2024-09-13 09:27:25,066 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 10 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2024-09-13 09:27:25,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2024-09-13 09:27:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-13 09:27:25,067 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:25,067 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:25,080 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 09:27:25,271 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:25,272 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:25,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-09-13 09:27:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:25,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452211126] [2024-09-13 09:27:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:27:25,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401250593] [2024-09-13 09:27:25,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:25,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:25,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:27:25,306 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-13 09:27:25,308 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-13 09:27:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:25,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-13 09:27:25,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:27:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-09-13 09:27:25,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:27:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-13 09:27:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452211126] [2024-09-13 09:27:26,187 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:27:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401250593] [2024-09-13 09:27:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401250593] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:27:26,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 09:27:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-09-13 09:27:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493321159] [2024-09-13 09:27:26,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 09:27:26,188 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 09:27:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 09:27:26,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-09-13 09:27:26,189 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 12 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 11 states have call predecessors, (26), 10 states have call successors, (26) [2024-09-13 09:27:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:26,920 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2024-09-13 09:27:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-13 09:27:26,920 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 12 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 11 states have call predecessors, (26), 10 states have call successors, (26) Word has length 85 [2024-09-13 09:27:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:26,922 INFO L225 Difference]: With dead ends: 133 [2024-09-13 09:27:26,922 INFO L226 Difference]: Without dead ends: 129 [2024-09-13 09:27:26,923 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2024-09-13 09:27:26,923 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:26,924 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 344 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 09:27:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-09-13 09:27:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2024-09-13 09:27:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-09-13 09:27:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-09-13 09:27:26,952 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 85 [2024-09-13 09:27:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:26,953 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-09-13 09:27:26,953 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 12 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 11 states have call predecessors, (26), 10 states have call successors, (26) [2024-09-13 09:27:26,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-09-13 09:27:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-13 09:27:26,954 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:26,955 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:26,972 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-13 09:27:27,155 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:27,156 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:27,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1204328542, now seen corresponding path program 1 times [2024-09-13 09:27:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:27,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608496418] [2024-09-13 09:27:27,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:27,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,265 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:27:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:27:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 09:27:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 09:27:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 09:27:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,278 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 09:27:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 09:27:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 09:27:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 09:27:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 09:27:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 09:27:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 09:27:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-13 09:27:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 09:27:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 09:27:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-13 09:27:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-13 09:27:27,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:27,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608496418] [2024-09-13 09:27:27,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608496418] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 09:27:27,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595231618] [2024-09-13 09:27:27,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:27,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:27,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:27:27,308 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-13 09:27:27,309 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-13 09:27:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-13 09:27:27,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:27:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-13 09:27:27,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 09:27:27,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595231618] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:27:27,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 09:27:27,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-09-13 09:27:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393157356] [2024-09-13 09:27:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:27:27,392 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:27:27,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:27,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:27:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:27:27,393 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-13 09:27:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:27,454 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2024-09-13 09:27:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:27:27,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 94 [2024-09-13 09:27:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:27,456 INFO L225 Difference]: With dead ends: 132 [2024-09-13 09:27:27,456 INFO L226 Difference]: Without dead ends: 120 [2024-09-13 09:27:27,456 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:27:27,456 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:27,457 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 98 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:27:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-13 09:27:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-09-13 09:27:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 73 states have internal predecessors, (83), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-09-13 09:27:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2024-09-13 09:27:27,484 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 94 [2024-09-13 09:27:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:27,485 INFO L474 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2024-09-13 09:27:27,485 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-13 09:27:27,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2024-09-13 09:27:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-09-13 09:27:27,486 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:27,486 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:27,508 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-13 09:27:27,690 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-13 09:27:27,691 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:27,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1544157164, now seen corresponding path program 2 times [2024-09-13 09:27:27,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:27,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292076575] [2024-09-13 09:27:27,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:27,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:27:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:27:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 09:27:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 09:27:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 09:27:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 09:27:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 09:27:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 09:27:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 09:27:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 09:27:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 09:27:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 09:27:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-13 09:27:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,888 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-13 09:27:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-13 09:27:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-13 09:27:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-13 09:27:27,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292076575] [2024-09-13 09:27:27,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292076575] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 09:27:27,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304782264] [2024-09-13 09:27:27,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 09:27:27,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:27,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:27:27,899 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-13 09:27:27,903 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-13 09:27:27,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 09:27:27,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 09:27:27,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 09:27:27,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:27:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 109 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-09-13 09:27:27,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:27:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-13 09:27:28,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304782264] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:27:28,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 09:27:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-09-13 09:27:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882289953] [2024-09-13 09:27:28,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 09:27:28,086 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:27:28,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:28,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:27:28,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:27:28,087 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2024-09-13 09:27:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:28,149 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2024-09-13 09:27:28,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 09:27:28,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) Word has length 98 [2024-09-13 09:27:28,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:28,152 INFO L225 Difference]: With dead ends: 146 [2024-09-13 09:27:28,152 INFO L226 Difference]: Without dead ends: 101 [2024-09-13 09:27:28,152 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:27:28,153 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:28,153 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:27:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-13 09:27:28,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-09-13 09:27:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 61 states have internal predecessors, (67), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-13 09:27:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2024-09-13 09:27:28,178 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 98 [2024-09-13 09:27:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:28,178 INFO L474 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2024-09-13 09:27:28,179 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2024-09-13 09:27:28,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2024-09-13 09:27:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-13 09:27:28,180 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:27:28,180 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:28,201 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-13 09:27:28,384 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:28,385 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:27:28,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1973122394, now seen corresponding path program 3 times [2024-09-13 09:27:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:27:28,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227579991] [2024-09-13 09:27:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:27:28,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:27:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:27:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:27:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 09:27:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 09:27:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 09:27:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 09:27:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 09:27:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 09:27:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 09:27:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 09:27:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 09:27:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 09:27:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-13 09:27:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 09:27:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,681 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 09:27:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-13 09:27:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-13 09:27:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-13 09:27:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-13 09:27:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:27:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-09-13 09:27:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:27:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227579991] [2024-09-13 09:27:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227579991] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 09:27:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247988577] [2024-09-13 09:27:28,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 09:27:28,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:28,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:27:28,690 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-13 09:27:28,693 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-13 09:27:28,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 09:27:28,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 09:27:28,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-13 09:27:28,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:27:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 246 proven. 3 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-09-13 09:27:28,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:27:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-09-13 09:27:28,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247988577] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:27:28,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 09:27:28,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2024-09-13 09:27:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409007387] [2024-09-13 09:27:28,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 09:27:28,978 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-13 09:27:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:27:28,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-13 09:27:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-09-13 09:27:28,979 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 11 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 13 states have call predecessors, (38), 11 states have call successors, (38) [2024-09-13 09:27:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:27:29,080 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-09-13 09:27:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 09:27:29,080 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 11 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 13 states have call predecessors, (38), 11 states have call successors, (38) Word has length 115 [2024-09-13 09:27:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:27:29,080 INFO L225 Difference]: With dead ends: 105 [2024-09-13 09:27:29,080 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 09:27:29,081 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-09-13 09:27:29,081 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:27:29,081 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 176 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:27:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 09:27:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 09:27:29,082 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-13 09:27:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 09:27:29,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2024-09-13 09:27:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:27:29,082 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 09:27:29,082 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 11 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 13 states have call predecessors, (38), 11 states have call successors, (38) [2024-09-13 09:27:29,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:27:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 09:27:29,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 09:27:29,086 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 09:27:29,098 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-13 09:27:29,290 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:27:29,294 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:27:29,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 09:27:29,890 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 09:27:29,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 09:27:29 BoogieIcfgContainer [2024-09-13 09:27:29,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 09:27:29,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 09:27:29,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 09:27:29,912 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 09:27:29,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:27:20" (3/4) ... [2024-09-13 09:27:29,914 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 09:27:29,917 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 09:27:29,918 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-13 09:27:29,918 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 09:27:29,918 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-13 09:27:29,922 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-13 09:27:29,922 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-13 09:27:29,922 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-13 09:27:29,923 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 09:27:29,999 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 09:27:29,999 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 09:27:30,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 09:27:30,000 INFO L158 Benchmark]: Toolchain (without parser) took 10467.50ms. Allocated memory was 142.6MB in the beginning and 297.8MB in the end (delta: 155.2MB). Free memory was 74.1MB in the beginning and 115.1MB in the end (delta: -41.0MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2024-09-13 09:27:30,000 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 107.9MB in the end (delta: 286.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 09:27:30,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.21ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 62.1MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-13 09:27:30,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 14.33ms. Allocated memory is still 142.6MB. Free memory was 62.1MB in the beginning and 61.1MB in the end (delta: 978.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 09:27:30,001 INFO L158 Benchmark]: Boogie Preprocessor took 27.81ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 09:27:30,001 INFO L158 Benchmark]: RCFGBuilder took 310.42ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 59.0MB in the beginning and 176.5MB in the end (delta: -117.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-09-13 09:27:30,001 INFO L158 Benchmark]: TraceAbstraction took 9821.53ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 175.8MB in the beginning and 120.3MB in the end (delta: 55.5MB). Peak memory consumption was 147.4MB. Max. memory is 16.1GB. [2024-09-13 09:27:30,001 INFO L158 Benchmark]: Witness Printer took 88.34ms. Allocated memory is still 297.8MB. Free memory was 120.3MB in the beginning and 115.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 09:27:30,002 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 142.6MB. Free memory was 108.2MB in the beginning and 107.9MB in the end (delta: 286.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.21ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 62.1MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 14.33ms. Allocated memory is still 142.6MB. Free memory was 62.1MB in the beginning and 61.1MB in the end (delta: 978.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.81ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.42ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 59.0MB in the beginning and 176.5MB in the end (delta: -117.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9821.53ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 175.8MB in the beginning and 120.3MB in the end (delta: 55.5MB). Peak memory consumption was 147.4MB. Max. memory is 16.1GB. * Witness Printer took 88.34ms. Allocated memory is still 297.8MB. Free memory was 120.3MB in the beginning and 115.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 1925 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1465 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1013 IncrementalHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 460 mSDtfsCounter, 1013 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1275 GetRequests, 1158 SyntacticMatches, 5 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=10, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1348 NumberOfCodeBlocks, 1290 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 6056 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1223 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 4005/4124 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((B % 4294967296) == 1) && (p == 2)) && (r == 1)) && ((A % 4294967296) == 1)) && (d == 2)) && (q == 0)) || (((((((B % 4294967296) == 1) && (r == 0)) && ((A % 4294967296) == 1)) && (d == 1)) && (q == 1)) && (p == 1))) || (((((A % 4294967296) == r) && ((d + ((B / 4294967296) * 4294967296)) == B)) && (q == 0)) && (p == 1))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((A % 4294967296) == r) && (A <= (((A / 4294967296) * 4294967296) + 1))) && ((((B / 4294967296) * 4294967296) + 1) == B)) && (d == 1)) && (q == 0)) && (p == 1)) || (((((((B % 4294967296) == 1) && ((A % 4294967296) == r)) && (p == 2)) && (r == 1)) && (d == 2)) && (q == 0))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-13 09:27:30,021 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