./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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/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 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:52:51,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:52:51,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:52:51,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:52:51,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:52:51,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:52:51,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:52:51,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:52:51,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:52:51,258 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:52:51,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:52:51,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:52:51,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:52:51,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:52:51,260 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:52:51,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:52:51,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:52:51,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:52:51,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:52:51,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:52:51,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:52:51,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:52:51,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:52:51,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:52:51,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:52:51,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:52:51,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:52:51,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:52:51,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:52:51,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:52:51,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:52:51,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:52:51,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:52:51,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:52:51,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:52:51,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:52:51,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:52:51,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:52:51,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:52:51,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:52:51,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:52:51,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:52:51,273 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:52:51,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:52:51,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:52:51,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:52:51,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:52:51,569 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:52:51,570 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-10-15 14:52:53,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:52:53,272 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:52:53,273 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2024-10-15 14:52:53,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a6628050c/f2111b8690ef45f99f86aa8c09caa60d/FLAG0d429fd3d [2024-10-15 14:52:53,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a6628050c/f2111b8690ef45f99f86aa8c09caa60d [2024-10-15 14:52:53,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:52:53,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:52:53,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:52:53,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:52:53,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:52:53,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ed5f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53, skipping insertion in model container [2024-10-15 14:52:53,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:52:53,535 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2024-10-15 14:52:53,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:52:53,572 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:52:53,584 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2024-10-15 14:52:53,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:52:53,629 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:52:53,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53 WrapperNode [2024-10-15 14:52:53,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:52:53,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:52:53,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:52:53,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:52:53,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,663 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:52:53,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:52:53,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:52:53,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:52:53,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:52:53,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,695 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-10-15 14:52:53,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:52:53,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:52:53,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:52:53,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:52:53,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (1/1) ... [2024-10-15 14:52:53,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:52:53,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:53,751 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-10-15 14:52:53,756 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-10-15 14:52:53,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:52:53,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:52:53,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:52:53,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:52:53,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:52:53,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:52:53,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:52:53,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:52:53,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:52:53,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:52:53,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:52:53,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:52:53,865 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:52:53,867 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:52:54,116 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:52:54,117 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:52:54,146 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:52:54,146 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:52:54,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:52:54 BoogieIcfgContainer [2024-10-15 14:52:54,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:52:54,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:52:54,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:52:54,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:52:54,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:52:53" (1/3) ... [2024-10-15 14:52:54,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8bd424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:52:54, skipping insertion in model container [2024-10-15 14:52:54,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:53" (2/3) ... [2024-10-15 14:52:54,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8bd424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:52:54, skipping insertion in model container [2024-10-15 14:52:54,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:52:54" (3/3) ... [2024-10-15 14:52:54,161 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2024-10-15 14:52:54,175 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:52:54,176 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:52:54,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:52:54,235 INFO L333 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;@250e84c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:52:54,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:52:54,239 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-10-15 14:52:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-15 14:52:54,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:54,246 INFO L215 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-10-15 14:52:54,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:54,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-10-15 14:52:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:54,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780149365] [2024-10-15 14:52:54,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:54,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:54,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:54,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:54,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:54,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:52:54,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:54,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780149365] [2024-10-15 14:52:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780149365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:54,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:52:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715345026] [2024-10-15 14:52:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:54,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:52:54,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:52:54,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:52:54,507 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-10-15 14:52:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:54,545 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-10-15 14:52:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:52:54,548 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-10-15 14:52:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:54,556 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:52:54,556 INFO L226 Difference]: Without dead ends: 32 [2024-10-15 14:52:54,560 INFO L431 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-10-15 14:52:54,563 INFO L432 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-10-15 14:52:54,564 INFO L433 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-10-15 14:52:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-15 14:52:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-15 14:52:54,602 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-10-15 14:52:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-10-15 14:52:54,606 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-10-15 14:52:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:54,607 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-15 14:52:54,607 INFO L472 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-10-15 14:52:54,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-10-15 14:52:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-15 14:52:54,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:54,612 INFO L215 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-10-15 14:52:54,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:52:54,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:54,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-10-15 14:52:54,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:54,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825943456] [2024-10-15 14:52:54,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:54,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:54,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:52:54,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:54,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825943456] [2024-10-15 14:52:54,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825943456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:54,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:54,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:54,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935442146] [2024-10-15 14:52:54,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:54,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:54,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:54,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:54,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:54,961 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-10-15 14:52:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:55,040 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-10-15 14:52:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:55,041 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-10-15 14:52:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:55,043 INFO L225 Difference]: With dead ends: 45 [2024-10-15 14:52:55,044 INFO L226 Difference]: Without dead ends: 43 [2024-10-15 14:52:55,044 INFO L431 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-10-15 14:52:55,045 INFO L432 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-10-15 14:52:55,047 INFO L433 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-10-15 14:52:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-15 14:52:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-10-15 14:52:55,064 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-10-15 14:52:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-15 14:52:55,067 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-10-15 14:52:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:55,068 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-15 14:52:55,068 INFO L472 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-10-15 14:52:55,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-10-15 14:52:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-15 14:52:55,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:55,070 INFO L215 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-10-15 14:52:55,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:52:55,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:55,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-10-15 14:52:55,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:55,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977222301] [2024-10-15 14:52:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:52:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:52:55,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:55,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977222301] [2024-10-15 14:52:55,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977222301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:55,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:55,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:55,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533209199] [2024-10-15 14:52:55,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:55,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:55,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:55,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:55,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:55,231 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-10-15 14:52:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:55,314 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-10-15 14:52:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:55,314 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-10-15 14:52:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:55,316 INFO L225 Difference]: With dead ends: 49 [2024-10-15 14:52:55,316 INFO L226 Difference]: Without dead ends: 47 [2024-10-15 14:52:55,316 INFO L431 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-10-15 14:52:55,317 INFO L432 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-10-15 14:52:55,318 INFO L433 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-10-15 14:52:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-15 14:52:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-10-15 14:52:55,326 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-10-15 14:52:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-15 14:52:55,327 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-10-15 14:52:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:55,328 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-15 14:52:55,328 INFO L472 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-10-15 14:52:55,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-10-15 14:52:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-15 14:52:55,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:55,329 INFO L215 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-10-15 14:52:55,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:52:55,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:55,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-10-15 14:52:55,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024124972] [2024-10-15 14:52:55,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:55,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257493744] [2024-10-15 14:52:55,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:55,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:55,374 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-10-15 14:52:55,377 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:52:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:52:55,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-15 14:52:55,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:52:55,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:55,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024124972] [2024-10-15 14:52:55,559 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:52:55,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257493744] [2024-10-15 14:52:55,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257493744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:55,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:55,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288902007] [2024-10-15 14:52:55,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:55,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:55,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:55,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:55,563 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-10-15 14:52:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:55,669 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-10-15 14:52:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:55,670 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-10-15 14:52:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:55,671 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:52:55,671 INFO L226 Difference]: Without dead ends: 53 [2024-10-15 14:52:55,672 INFO L431 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-10-15 14:52:55,673 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:55,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:52:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-15 14:52:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-15 14:52:55,695 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-10-15 14:52:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-10-15 14:52:55,697 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-10-15 14:52:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:55,697 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-10-15 14:52:55,698 INFO L472 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-10-15 14:52:55,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-10-15 14:52:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-15 14:52:55,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:55,699 INFO L215 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-10-15 14:52:55,718 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:52:55,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:55,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:55,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-10-15 14:52:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:55,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413185232] [2024-10-15 14:52:55,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:55,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:55,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363878324] [2024-10-15 14:52:55,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:55,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:55,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:55,937 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-10-15 14:52:55,941 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:52:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:56,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-15 14:52:56,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-15 14:52:56,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:52:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-15 14:52:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413185232] [2024-10-15 14:52:56,411 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:52:56,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363878324] [2024-10-15 14:52:56,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363878324] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:52:56,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:52:56,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-15 14:52:56,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3125566] [2024-10-15 14:52:56,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:52:56,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:52:56,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:52:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:52:56,416 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-10-15 14:52:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:56,558 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-10-15 14:52:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:52:56,559 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-10-15 14:52:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:56,564 INFO L225 Difference]: With dead ends: 68 [2024-10-15 14:52:56,564 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 14:52:56,564 INFO L431 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-10-15 14:52:56,565 INFO L432 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-10-15 14:52:56,566 INFO L433 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-10-15 14:52:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 14:52:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-10-15 14:52:56,586 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-10-15 14:52:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-10-15 14:52:56,588 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 44 [2024-10-15 14:52:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:56,588 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-10-15 14:52:56,588 INFO L472 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-10-15 14:52:56,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-10-15 14:52:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-15 14:52:56,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:56,590 INFO L215 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-10-15 14:52:56,606 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 14:52:56,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:56,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:56,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-10-15 14:52:56,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:56,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547034364] [2024-10-15 14:52:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:56,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:56,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703333453] [2024-10-15 14:52:56,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:56,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:56,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:56,818 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-10-15 14:52:56,826 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:52:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:56,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-15 14:52:56,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-15 14:52:57,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:52:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-15 14:52:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547034364] [2024-10-15 14:52:57,249 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:52:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703333453] [2024-10-15 14:52:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703333453] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:52:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:52:57,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-15 14:52:57,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599697002] [2024-10-15 14:52:57,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:57,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:57,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:57,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:52:57,253 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-10-15 14:52:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:57,335 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-10-15 14:52:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:57,336 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-10-15 14:52:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:57,338 INFO L225 Difference]: With dead ends: 73 [2024-10-15 14:52:57,339 INFO L226 Difference]: Without dead ends: 71 [2024-10-15 14:52:57,340 INFO L431 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-10-15 14:52:57,340 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:57,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:52:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-15 14:52:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-15 14:52:57,369 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-10-15 14:52:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-10-15 14:52:57,371 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2024-10-15 14:52:57,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:57,372 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-10-15 14:52:57,372 INFO L472 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-10-15 14:52:57,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-10-15 14:52:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-15 14:52:57,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:57,376 INFO L215 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-10-15 14:52:57,394 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 14:52:57,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-15 14:52:57,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:57,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:57,578 INFO L85 PathProgramCache]: Analyzing trace with hash 515743006, now seen corresponding path program 1 times [2024-10-15 14:52:57,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:57,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330850483] [2024-10-15 14:52:57,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:52:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:52:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:52:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:52:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:52:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:52:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-15 14:52:57,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330850483] [2024-10-15 14:52:57,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330850483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:57,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:57,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432958853] [2024-10-15 14:52:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:57,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:57,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:57,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:57,787 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-10-15 14:52:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:57,856 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-10-15 14:52:57,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:57,857 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-10-15 14:52:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:57,859 INFO L225 Difference]: With dead ends: 78 [2024-10-15 14:52:57,859 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 14:52:57,859 INFO L431 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-10-15 14:52:57,862 INFO L432 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-10-15 14:52:57,862 INFO L433 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-10-15 14:52:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 14:52:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-15 14:52:57,884 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-10-15 14:52:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-10-15 14:52:57,886 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2024-10-15 14:52:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:57,886 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-10-15 14:52:57,886 INFO L472 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-10-15 14:52:57,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-10-15 14:52:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-15 14:52:57,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:57,890 INFO L215 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-10-15 14:52:57,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:52:57,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:57,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-10-15 14:52:57,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:57,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899785744] [2024-10-15 14:52:57,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:57,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:57,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229865875] [2024-10-15 14:52:57,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:57,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:57,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:57,937 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-10-15 14:52:57,938 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:52:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-15 14:52:58,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-15 14:52:58,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-15 14:53:00,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:00,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899785744] [2024-10-15 14:53:00,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:00,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229865875] [2024-10-15 14:53:00,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229865875] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:00,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:53:00,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-10-15 14:53:00,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072168255] [2024-10-15 14:53:00,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:00,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 14:53:00,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:00,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 14:53:00,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-10-15 14:53:00,582 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-10-15 14:53:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:01,110 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2024-10-15 14:53:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:53:01,111 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-10-15 14:53:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:01,113 INFO L225 Difference]: With dead ends: 122 [2024-10-15 14:53:01,113 INFO L226 Difference]: Without dead ends: 99 [2024-10-15 14:53:01,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-10-15 14:53:01,115 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:01,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 329 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:53:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-15 14:53:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2024-10-15 14:53:01,138 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-10-15 14:53:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2024-10-15 14:53:01,139 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 74 [2024-10-15 14:53:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:01,140 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2024-10-15 14:53:01,140 INFO L472 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-10-15 14:53:01,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2024-10-15 14:53:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-15 14:53:01,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:01,142 INFO L215 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-10-15 14:53:01,160 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-15 14:53:01,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:01,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:01,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-10-15 14:53:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:01,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61708678] [2024-10-15 14:53:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:53:01,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579218281] [2024-10-15 14:53:01,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:01,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:01,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:01,388 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-10-15 14:53:01,389 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:53:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:01,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-15 14:53:01,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-15 14:53:01,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-15 14:53:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61708678] [2024-10-15 14:53:02,594 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579218281] [2024-10-15 14:53:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579218281] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:02,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:53:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-10-15 14:53:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375991166] [2024-10-15 14:53:02,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:02,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-15 14:53:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:02,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-15 14:53:02,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-15 14:53:02,600 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-10-15 14:53:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:03,645 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2024-10-15 14:53:03,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-15 14:53:03,645 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-10-15 14:53:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:03,648 INFO L225 Difference]: With dead ends: 133 [2024-10-15 14:53:03,648 INFO L226 Difference]: Without dead ends: 129 [2024-10-15 14:53:03,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2024-10-15 14:53:03,650 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:03,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 344 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:53:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-15 14:53:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2024-10-15 14:53:03,690 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-10-15 14:53:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-10-15 14:53:03,692 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 85 [2024-10-15 14:53:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:03,692 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-10-15 14:53:03,692 INFO L472 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-10-15 14:53:03,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-10-15 14:53:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-15 14:53:03,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:03,694 INFO L215 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-10-15 14:53:03,712 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 14:53:03,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:03,899 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:03,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1204328542, now seen corresponding path program 1 times [2024-10-15 14:53:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226645439] [2024-10-15 14:53:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:03,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:03,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:03,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:53:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-15 14:53:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-15 14:53:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-15 14:53:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-15 14:53:04,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:04,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226645439] [2024-10-15 14:53:04,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226645439] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:04,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558134575] [2024-10-15 14:53:04,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:04,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:04,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:04,036 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-10-15 14:53:04,038 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:53:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 14:53:04,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-15 14:53:04,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:53:04,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558134575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:53:04,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:53:04,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-10-15 14:53:04,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479544199] [2024-10-15 14:53:04,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:53:04,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:53:04,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:04,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:53:04,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:53:04,148 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-10-15 14:53:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:04,244 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2024-10-15 14:53:04,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:53:04,245 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-10-15 14:53:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:04,247 INFO L225 Difference]: With dead ends: 132 [2024-10-15 14:53:04,247 INFO L226 Difference]: Without dead ends: 120 [2024-10-15 14:53:04,247 INFO L431 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-10-15 14:53:04,248 INFO L432 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-10-15 14:53:04,248 INFO L433 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-10-15 14:53:04,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-15 14:53:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-15 14:53:04,291 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-10-15 14:53:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2024-10-15 14:53:04,293 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 94 [2024-10-15 14:53:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:04,293 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2024-10-15 14:53:04,293 INFO L472 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-10-15 14:53:04,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2024-10-15 14:53:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-15 14:53:04,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:04,295 INFO L215 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-10-15 14:53:04,312 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-15 14:53:04,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-15 14:53:04,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:04,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:04,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1544157164, now seen corresponding path program 2 times [2024-10-15 14:53:04,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:04,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460875288] [2024-10-15 14:53:04,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:04,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:53:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-15 14:53:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-15 14:53:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-15 14:53:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-15 14:53:04,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460875288] [2024-10-15 14:53:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460875288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035596309] [2024-10-15 14:53:04,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:53:04,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:04,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:04,736 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-10-15 14:53:04,737 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-15 14:53:04,796 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:53:04,796 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:04,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:53:04,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 109 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-15 14:53:04,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-15 14:53:04,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035596309] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:04,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:04,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-15 14:53:04,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600422040] [2024-10-15 14:53:04,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:04,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:53:04,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:04,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:53:04,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:53:04,937 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-10-15 14:53:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:05,019 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2024-10-15 14:53:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 14:53:05,020 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-10-15 14:53:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:05,021 INFO L225 Difference]: With dead ends: 146 [2024-10-15 14:53:05,021 INFO L226 Difference]: Without dead ends: 101 [2024-10-15 14:53:05,022 INFO L431 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-10-15 14:53:05,022 INFO L432 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-10-15 14:53:05,023 INFO L433 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-10-15 14:53:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-15 14:53:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-15 14:53:05,048 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-10-15 14:53:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2024-10-15 14:53:05,049 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 98 [2024-10-15 14:53:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:05,050 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2024-10-15 14:53:05,050 INFO L472 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-10-15 14:53:05,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2024-10-15 14:53:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-15 14:53:05,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:05,051 INFO L215 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-10-15 14:53:05,068 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-15 14:53:05,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:05,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:05,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1973122394, now seen corresponding path program 3 times [2024-10-15 14:53:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:05,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225887870] [2024-10-15 14:53:05,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:53:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-15 14:53:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-15 14:53:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-15 14:53:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-15 14:53:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-15 14:53:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-15 14:53:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-10-15 14:53:05,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:05,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225887870] [2024-10-15 14:53:05,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225887870] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:05,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198589345] [2024-10-15 14:53:05,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:53:05,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:05,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:05,679 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-10-15 14:53:05,681 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 14:53:05,734 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-15 14:53:05,734 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:05,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-15 14:53:05,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 246 proven. 3 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-10-15 14:53:05,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-10-15 14:53:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198589345] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:06,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:06,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2024-10-15 14:53:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352061449] [2024-10-15 14:53:06,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:06,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-15 14:53:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:06,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 14:53:06,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-15 14:53:06,083 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-10-15 14:53:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:06,216 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-10-15 14:53:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:53:06,217 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-10-15 14:53:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:06,217 INFO L225 Difference]: With dead ends: 105 [2024-10-15 14:53:06,217 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:53:06,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-10-15 14:53:06,219 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-10-15 14:53:06,219 INFO L433 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-10-15 14:53:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:53:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:53:06,220 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-10-15 14:53:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:53:06,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2024-10-15 14:53:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:06,221 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:53:06,221 INFO L472 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-10-15 14:53:06,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:53:06,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:53:06,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:53:06,243 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-15 14:53:06,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:06,429 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:06,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:53:07,019 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:53:07,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:53:07 BoogieIcfgContainer [2024-10-15 14:53:07,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:53:07,046 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:53:07,046 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:53:07,046 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:53:07,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:52:54" (3/4) ... [2024-10-15 14:53:07,049 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:53:07,101 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:53:07,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:53:07,102 INFO L158 Benchmark]: Toolchain (without parser) took 13791.37ms. Allocated memory was 138.4MB in the beginning and 257.9MB in the end (delta: 119.5MB). Free memory was 66.4MB in the beginning and 114.4MB in the end (delta: -48.0MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2024-10-15 14:53:07,103 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 100.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:53:07,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.39ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 66.2MB in the beginning and 146.8MB in the end (delta: -80.6MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-10-15 14:53:07,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.15ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 145.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:53:07,104 INFO L158 Benchmark]: Boogie Preprocessor took 50.55ms. Allocated memory is still 178.3MB. Free memory was 145.8MB in the beginning and 147.1MB in the end (delta: -1.4MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-10-15 14:53:07,104 INFO L158 Benchmark]: RCFGBuilder took 431.80ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 132.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-15 14:53:07,104 INFO L158 Benchmark]: TraceAbstraction took 12895.02ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 132.4MB in the beginning and 116.5MB in the end (delta: 15.9MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2024-10-15 14:53:07,105 INFO L158 Benchmark]: Witness Printer took 55.39ms. Allocated memory is still 257.9MB. Free memory was 116.5MB in the beginning and 114.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:53:07,107 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.19ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 100.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.39ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 66.2MB in the beginning and 146.8MB in the end (delta: -80.6MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.15ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 145.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.55ms. Allocated memory is still 178.3MB. Free memory was 145.8MB in the beginning and 147.1MB in the end (delta: -1.4MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * RCFGBuilder took 431.80ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 132.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12895.02ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 132.4MB in the beginning and 116.5MB in the end (delta: 15.9MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * Witness Printer took 55.39ms. Allocated memory is still 257.9MB. Free memory was 116.5MB in the beginning and 114.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 12.2s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 1925 SdHoareTripleChecker+Invalid, 1.1s 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, 1159 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.0s 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.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1348 NumberOfCodeBlocks, 1290 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 5858 SizeOfPredicates, 13 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 == 1) && (p == 2)) && (r == 1)) && (A == 1)) && (d == 2)) && (q == 0)) || ((((((B == 1) && (r == 0)) && (A == 1)) && (d == 1)) && (q == 1)) && (p == 1))) || ((((d == B) && (A == r)) && (q == 0)) && (p == 1))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((B == 1) && (p == 2)) && (r == 1)) && (A == 1)) && (d == 2)) && (q == 0)) || ((((((B == 1) && (A == r)) && (A <= 1)) && (d == 1)) && (q == 0)) && (p == 1))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:53:07,139 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