./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.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 969ea7ac1a6cea553b276c54292ec8e81265daf8dd23428f445a60f39343440e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:46:44,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:46:44,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:46:44,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:46:44,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:46:44,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:46:44,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:46:44,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:46:44,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:46:44,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:46:44,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:46:44,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:46:44,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:46:44,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:46:44,595 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:46:44,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:46:44,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:46:44,595 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:46:44,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:46:44,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:46:44,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:46:44,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:46:44,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:46:44,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:46:44,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:46:44,601 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:46:44,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:46:44,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:46:44,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:46:44,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:46:44,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:46:44,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:46:44,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:46:44,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:46:44,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:46:44,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:46:44,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:46:44,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:46:44,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:46:44,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:46:44,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:46:44,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:46:44,605 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 -> 969ea7ac1a6cea553b276c54292ec8e81265daf8dd23428f445a60f39343440e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 15:46:44,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:46:44,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:46:44,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:46:44,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:46:44,903 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:46:44,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c [2024-09-12 15:46:46,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:46:46,392 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:46:46,393 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c [2024-09-12 15:46:46,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/246c64715/3f3bdcdb2b8c4e62bda5be42079f31d5/FLAG15f6639cb [2024-09-12 15:46:46,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/246c64715/3f3bdcdb2b8c4e62bda5be42079f31d5 [2024-09-12 15:46:46,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:46:46,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:46:46,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:46:46,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:46:46,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:46:46,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:46:46" (1/1) ... [2024-09-12 15:46:46,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2828c163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:46, skipping insertion in model container [2024-09-12 15:46:46,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:46:46" (1/1) ... [2024-09-12 15:46:46,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:46:46,964 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c[576,589] [2024-09-12 15:46:46,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:46:46,992 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:46:47,000 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c[576,589] [2024-09-12 15:46:47,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:46:47,022 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:46:47,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47 WrapperNode [2024-09-12 15:46:47,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:46:47,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:46:47,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:46:47,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:46:47,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,040 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:46:47,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:46:47,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:46:47,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:46:47,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:46:47,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,065 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 15:46:47,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:46:47,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:46:47,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:46:47,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:46:47,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (1/1) ... [2024-09-12 15:46:47,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:46:47,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:46:47,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 15:46:47,110 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 15:46:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:46:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 15:46:47,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 15:46:47,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:46:47,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:46:47,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:46:47,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:46:47,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:46:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:46:47,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:46:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 15:46:47,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 15:46:47,208 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:46:47,210 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:46:47,355 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-12 15:46:47,356 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:46:47,379 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:46:47,380 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 15:46:47,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:46:47 BoogieIcfgContainer [2024-09-12 15:46:47,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:46:47,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:46:47,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:46:47,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:46:47,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:46:46" (1/3) ... [2024-09-12 15:46:47,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3c9d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:46:47, skipping insertion in model container [2024-09-12 15:46:47,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:46:47" (2/3) ... [2024-09-12 15:46:47,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3c9d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:46:47, skipping insertion in model container [2024-09-12 15:46:47,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:46:47" (3/3) ... [2024-09-12 15:46:47,388 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound2.c [2024-09-12 15:46:47,403 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:46:47,403 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:46:47,461 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:46:47,468 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@468b88b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:46:47,469 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:46:47,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 15:46:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 15:46:47,480 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:46:47,481 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:46:47,481 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:46:47,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash -166019731, now seen corresponding path program 1 times [2024-09-12 15:46:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:46:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792873583] [2024-09-12 15:46:47,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:46:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:47,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:46:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:47,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:46:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:46:47,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:46:47,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792873583] [2024-09-12 15:46:47,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792873583] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:46:47,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:46:47,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:46:47,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768715061] [2024-09-12 15:46:47,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:46:47,661 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:46:47,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:46:47,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:46:47,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:46:47,682 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 15:46:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:46:47,768 INFO L93 Difference]: Finished difference Result 65 states and 98 transitions. [2024-09-12 15:46:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:46:47,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-12 15:46:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:46:47,775 INFO L225 Difference]: With dead ends: 65 [2024-09-12 15:46:47,776 INFO L226 Difference]: Without dead ends: 33 [2024-09-12 15:46:47,778 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:46:47,781 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:46:47,781 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:46:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-12 15:46:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-09-12 15:46:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 15:46:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-12 15:46:47,817 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 16 [2024-09-12 15:46:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:46:47,818 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-12 15:46:47,818 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 15:46:47,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-12 15:46:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 15:46:47,819 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:46:47,819 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:46:47,819 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:46:47,820 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:46:47,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1899526296, now seen corresponding path program 1 times [2024-09-12 15:46:47,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:46:47,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537764843] [2024-09-12 15:46:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:46:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:47,945 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:46:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:47,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:46:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:46:47,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:46:47,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537764843] [2024-09-12 15:46:47,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537764843] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:46:47,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:46:47,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:46:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477005579] [2024-09-12 15:46:47,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:46:47,964 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:46:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:46:47,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:46:47,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:46:47,965 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 15:46:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:46:48,085 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-09-12 15:46:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:46:48,086 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-09-12 15:46:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:46:48,087 INFO L225 Difference]: With dead ends: 41 [2024-09-12 15:46:48,087 INFO L226 Difference]: Without dead ends: 34 [2024-09-12 15:46:48,087 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:46:48,088 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:46:48,088 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:46:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-12 15:46:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-12 15:46:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 15:46:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-12 15:46:48,096 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 17 [2024-09-12 15:46:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:46:48,097 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-12 15:46:48,097 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 15:46:48,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-12 15:46:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 15:46:48,097 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:46:48,098 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:46:48,098 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 15:46:48,098 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:46:48,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1901015846, now seen corresponding path program 1 times [2024-09-12 15:46:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:46:48,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119232335] [2024-09-12 15:46:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:46:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 15:46:48,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621703801] [2024-09-12 15:46:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:48,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:48,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:46:48,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:46:48,114 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 15:46:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:48,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 15:46:48,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:46:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:46:48,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 15:46:48,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:46:48,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119232335] [2024-09-12 15:46:48,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 15:46:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621703801] [2024-09-12 15:46:48,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621703801] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:46:48,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:46:48,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:46:48,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043666190] [2024-09-12 15:46:48,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:46:48,221 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:46:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:46:48,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:46:48,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:46:48,224 INFO L87 Difference]: Start difference. First operand 34 states and 43 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 15:46:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:46:48,283 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-12 15:46:48,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:46:48,284 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-12 15:46:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:46:48,285 INFO L225 Difference]: With dead ends: 44 [2024-09-12 15:46:48,285 INFO L226 Difference]: Without dead ends: 42 [2024-09-12 15:46:48,285 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:46:48,286 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:46:48,290 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:46:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-12 15:46:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-09-12 15:46:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 15:46:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-09-12 15:46:48,306 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 17 [2024-09-12 15:46:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:46:48,306 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-09-12 15:46:48,307 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 15:46:48,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-09-12 15:46:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 15:46:48,309 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:46:48,309 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:46:48,321 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 15:46:48,513 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:48,514 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:46:48,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1706287866, now seen corresponding path program 1 times [2024-09-12 15:46:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:46:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018870813] [2024-09-12 15:46:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:46:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 15:46:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [877059550] [2024-09-12 15:46:48,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:48,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:48,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:46:48,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:46:48,544 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 15:46:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:48,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 15:46:48,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:46:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:46:48,626 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 15:46:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:46:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018870813] [2024-09-12 15:46:48,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 15:46:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877059550] [2024-09-12 15:46:48,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877059550] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:46:48,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:46:48,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:46:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832880806] [2024-09-12 15:46:48,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:46:48,627 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:46:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:46:48,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:46:48,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:46:48,632 INFO L87 Difference]: Start difference. First operand 39 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 15:46:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:46:48,700 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-09-12 15:46:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:46:48,700 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-12 15:46:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:46:48,701 INFO L225 Difference]: With dead ends: 57 [2024-09-12 15:46:48,701 INFO L226 Difference]: Without dead ends: 54 [2024-09-12 15:46:48,702 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:46:48,702 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:46:48,703 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:46:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-12 15:46:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-09-12 15:46:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-12 15:46:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-09-12 15:46:48,717 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 22 [2024-09-12 15:46:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:46:48,717 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-09-12 15:46:48,718 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 15:46:48,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-09-12 15:46:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 15:46:48,719 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:46:48,719 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:46:48,732 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 15:46:48,920 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:48,920 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:46:48,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1856957465, now seen corresponding path program 1 times [2024-09-12 15:46:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:46:48,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236908643] [2024-09-12 15:46:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:46:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 15:46:48,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [332994843] [2024-09-12 15:46:48,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:48,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:48,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:46:48,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:46:48,959 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 15:46:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:48,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 15:46:48,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:46:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:46:49,029 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 15:46:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:46:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236908643] [2024-09-12 15:46:49,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 15:46:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332994843] [2024-09-12 15:46:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332994843] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:46:49,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:46:49,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:46:49,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198047036] [2024-09-12 15:46:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:46:49,031 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:46:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:46:49,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:46:49,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:46:49,032 INFO L87 Difference]: Start difference. First operand 53 states and 68 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-12 15:46:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:46:49,103 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2024-09-12 15:46:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:46:49,104 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, (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 30 [2024-09-12 15:46:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:46:49,107 INFO L225 Difference]: With dead ends: 82 [2024-09-12 15:46:49,107 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 15:46:49,109 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:46:49,110 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:46:49,110 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 141 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:46:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 15:46:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2024-09-12 15:46:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-12 15:46:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2024-09-12 15:46:49,125 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 30 [2024-09-12 15:46:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:46:49,126 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2024-09-12 15:46:49,126 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-12 15:46:49,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2024-09-12 15:46:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 15:46:49,127 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:46:49,128 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:46:49,143 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 15:46:49,332 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:49,333 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:46:49,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1900127414, now seen corresponding path program 1 times [2024-09-12 15:46:49,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:46:49,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20653156] [2024-09-12 15:46:49,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:49,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:46:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:46:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:46:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-12 15:46:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-12 15:46:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:46:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:46:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20653156] [2024-09-12 15:46:49,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20653156] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:46:49,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:46:49,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:46:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936899662] [2024-09-12 15:46:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:46:49,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:46:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:46:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:46:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:46:49,478 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 15:46:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:46:49,592 INFO L93 Difference]: Finished difference Result 112 states and 152 transitions. [2024-09-12 15:46:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 15:46:49,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2024-09-12 15:46:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:46:49,595 INFO L225 Difference]: With dead ends: 112 [2024-09-12 15:46:49,596 INFO L226 Difference]: Without dead ends: 77 [2024-09-12 15:46:49,596 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:46:49,597 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:46:49,597 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:46:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-12 15:46:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-09-12 15:46:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 48 states have internal predecessors, (57), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-12 15:46:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2024-09-12 15:46:49,608 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 33 [2024-09-12 15:46:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:46:49,610 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2024-09-12 15:46:49,610 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 15:46:49,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2024-09-12 15:46:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 15:46:49,614 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:46:49,614 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:46:49,614 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 15:46:49,614 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:46:49,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2073680743, now seen corresponding path program 1 times [2024-09-12 15:46:49,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:46:49,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356316590] [2024-09-12 15:46:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:46:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:46:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,774 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:46:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-12 15:46:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-12 15:46:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 15:46:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 15:46:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:46:49,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:46:49,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356316590] [2024-09-12 15:46:49,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356316590] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:46:49,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:46:49,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 15:46:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276502362] [2024-09-12 15:46:49,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:46:49,827 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 15:46:49,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:46:49,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 15:46:49,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:46:49,829 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 15:46:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:46:49,987 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2024-09-12 15:46:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 15:46:49,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-09-12 15:46:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:46:49,992 INFO L225 Difference]: With dead ends: 83 [2024-09-12 15:46:49,992 INFO L226 Difference]: Without dead ends: 81 [2024-09-12 15:46:49,992 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-12 15:46:49,993 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:46:49,993 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 121 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:46:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-12 15:46:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-09-12 15:46:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-12 15:46:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-09-12 15:46:50,023 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 40 [2024-09-12 15:46:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:46:50,023 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-09-12 15:46:50,023 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 15:46:50,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-09-12 15:46:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-12 15:46:50,024 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:46:50,024 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:46:50,024 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 15:46:50,025 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:46:50,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash -930915559, now seen corresponding path program 1 times [2024-09-12 15:46:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:46:50,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43502222] [2024-09-12 15:46:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:46:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:50,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:46:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:50,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:46:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:50,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-12 15:46:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:50,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-12 15:46:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:50,151 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 15:46:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:50,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 15:46:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:50,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 15:46:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 15:46:50,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:46:50,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43502222] [2024-09-12 15:46:50,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43502222] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:46:50,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145882417] [2024-09-12 15:46:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:50,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:50,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:46:50,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:46:50,176 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 15:46:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:50,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 15:46:50,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:46:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-12 15:46:50,313 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 15:46:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145882417] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:46:50,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 15:46:50,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-09-12 15:46:50,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295744329] [2024-09-12 15:46:50,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:46:50,313 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:46:50,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:46:50,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:46:50,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-09-12 15:46:50,314 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-12 15:46:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:46:50,403 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2024-09-12 15:46:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:46:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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 46 [2024-09-12 15:46:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:46:50,405 INFO L225 Difference]: With dead ends: 94 [2024-09-12 15:46:50,405 INFO L226 Difference]: Without dead ends: 92 [2024-09-12 15:46:50,406 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-09-12 15:46:50,406 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:46:50,406 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 185 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:46:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-12 15:46:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-09-12 15:46:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 56 states have internal predecessors, (63), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-12 15:46:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2024-09-12 15:46:50,422 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 46 [2024-09-12 15:46:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:46:50,422 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2024-09-12 15:46:50,422 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-12 15:46:50,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2024-09-12 15:46:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-12 15:46:50,423 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:46:50,423 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2024-09-12 15:46:50,436 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 15:46:50,624 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:50,624 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:46:50,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash -872582608, now seen corresponding path program 1 times [2024-09-12 15:46:50,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:46:50,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149552749] [2024-09-12 15:46:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:50,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:46:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 15:46:50,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011029497] [2024-09-12 15:46:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:50,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:50,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:46:50,642 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:46:50,644 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 15:46:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:50,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-12 15:46:50,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:46:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-12 15:46:50,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:46:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-12 15:46:51,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:46:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149552749] [2024-09-12 15:46:51,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 15:46:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011029497] [2024-09-12 15:46:51,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011029497] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 15:46:51,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 15:46:51,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-09-12 15:46:51,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091539937] [2024-09-12 15:46:51,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:46:51,221 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 15:46:51,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:46:51,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 15:46:51,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-12 15:46:51,222 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 15:46:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:46:51,338 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2024-09-12 15:46:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:46:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 49 [2024-09-12 15:46:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:46:51,340 INFO L225 Difference]: With dead ends: 93 [2024-09-12 15:46:51,340 INFO L226 Difference]: Without dead ends: 90 [2024-09-12 15:46:51,340 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-09-12 15:46:51,341 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:46:51,341 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 113 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:46:51,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-12 15:46:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-09-12 15:46:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 58 states have internal predecessors, (63), 24 states have call successors, (24), 11 states have call predecessors, (24), 10 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-12 15:46:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2024-09-12 15:46:51,361 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 49 [2024-09-12 15:46:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:46:51,361 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2024-09-12 15:46:51,362 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 15:46:51,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2024-09-12 15:46:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-12 15:46:51,363 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:46:51,363 INFO L216 NwaCegarLoop]: trace histogram [10, 9, 9, 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, 1] [2024-09-12 15:46:51,377 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 15:46:51,567 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:51,568 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:46:51,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1070557628, now seen corresponding path program 1 times [2024-09-12 15:46:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:46:51,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525305947] [2024-09-12 15:46:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:51,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:46:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:46:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:46:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-12 15:46:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-12 15:46:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 15:46:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 15:46:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,708 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 15:46:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-12 15:46:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 15:46:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-12 15:46:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,717 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-12 15:46:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-09-12 15:46:51,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:46:51,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525305947] [2024-09-12 15:46:51,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525305947] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:46:51,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540987259] [2024-09-12 15:46:51,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:46:51,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:46:51,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:46:51,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:46:51,723 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 15:46:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:46:51,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 15:46:51,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:46:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-12 15:46:51,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:46:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-09-12 15:46:51,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540987259] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:46:51,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:46:51,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 9 [2024-09-12 15:46:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846906193] [2024-09-12 15:46:51,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:46:51,909 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 15:46:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:46:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 15:46:51,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:46:51,909 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 5 states have call predecessors, (23), 6 states have call successors, (23) [2024-09-12 15:46:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:46:52,028 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2024-09-12 15:46:52,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 15:46:52,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 5 states have call predecessors, (23), 6 states have call successors, (23) Word has length 70 [2024-09-12 15:46:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:46:52,029 INFO L225 Difference]: With dead ends: 125 [2024-09-12 15:46:52,029 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 15:46:52,030 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-09-12 15:46:52,030 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:46:52,031 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 73 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:46:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 15:46:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 15:46:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 15:46:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 15:46:52,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2024-09-12 15:46:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:46:52,031 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 15:46:52,031 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 5 states have call predecessors, (23), 6 states have call successors, (23) [2024-09-12 15:46:52,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:46:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 15:46:52,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 15:46:52,034 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 15:46:52,047 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 15:46:52,238 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 15:46:52,241 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:46:52,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 15:46:53,172 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 15:46:53,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 03:46:53 BoogieIcfgContainer [2024-09-12 15:46:53,193 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 15:46:53,193 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 15:46:53,193 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 15:46:53,194 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 15:46:53,194 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:46:47" (3/4) ... [2024-09-12 15:46:53,195 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 15:46:53,198 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 15:46:53,198 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-12 15:46:53,198 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 15:46:53,199 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 15:46:53,205 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-09-12 15:46:53,205 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-12 15:46:53,205 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 15:46:53,205 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 15:46:53,231 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(counter) == 0) && (((((2 <= counter) && ((((__int128) q * y) + r) == x)) && (((((__int128) q * y) + r) + ((__int128) a * y)) == (b + x))) && (1 <= y)) || ((((((a == 0) && (x == r)) && (b == 0)) && (counter == 0)) && (q == 0)) && (1 <= y)))) [2024-09-12 15:46:53,231 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 <= counter) && (a == 1)) && (((((__int128) q * y) + y) + r) == (b + x))) && (1 <= r)) && (b == y)) && (1 <= y)) || ((((((2 <= counter) && (x == r)) && (1 <= r)) && ((r + ((__int128) a * y)) == (b + x))) && (q == 0)) && (1 <= y))) || (((((((a == 1) && ((y + r) == (b + x))) && (1 <= r)) && (b == y)) && (q == 0)) && (counter == 1)) && (1 <= y))) && (\old(counter) == 0)) [2024-09-12 15:46:53,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 15:46:53,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 15:46:53,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 15:46:53,288 INFO L158 Benchmark]: Toolchain (without parser) took 6481.59ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 46.2MB in the beginning and 64.6MB in the end (delta: -18.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:46:53,288 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 54.5MB. Free memory was 33.4MB in the beginning and 33.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:46:53,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.80ms. Allocated memory is still 79.7MB. Free memory was 46.0MB in the beginning and 54.3MB in the end (delta: -8.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-09-12 15:46:53,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.71ms. Allocated memory is still 79.7MB. Free memory was 54.3MB in the beginning and 53.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 15:46:53,289 INFO L158 Benchmark]: Boogie Preprocessor took 36.73ms. Allocated memory is still 79.7MB. Free memory was 53.2MB in the beginning and 51.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 15:46:53,290 INFO L158 Benchmark]: RCFGBuilder took 301.90ms. Allocated memory is still 79.7MB. Free memory was 51.4MB in the beginning and 38.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 15:46:53,290 INFO L158 Benchmark]: TraceAbstraction took 5810.73ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 37.9MB in the beginning and 69.9MB in the end (delta: -32.1MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-09-12 15:46:53,290 INFO L158 Benchmark]: Witness Printer took 94.02ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 64.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 15:46:53,292 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 54.5MB. Free memory was 33.4MB in the beginning and 33.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.80ms. Allocated memory is still 79.7MB. Free memory was 46.0MB in the beginning and 54.3MB in the end (delta: -8.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.71ms. Allocated memory is still 79.7MB. Free memory was 54.3MB in the beginning and 53.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.73ms. Allocated memory is still 79.7MB. Free memory was 53.2MB in the beginning and 51.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 301.90ms. Allocated memory is still 79.7MB. Free memory was 51.4MB in the beginning and 38.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5810.73ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 37.9MB in the beginning and 69.9MB in the end (delta: -32.1MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Witness Printer took 94.02ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 64.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 4.8s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 1089 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 774 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 726 IncrementalHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 315 mSDtfsCounter, 726 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 390 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 1466 SizeOfPredicates, 11 NumberOfNonLiveVariables, 674 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 751/763 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: (((((((((2 <= counter) && (a == 1)) && (((((__int128) q * y) + y) + r) == (b + x))) && (1 <= r)) && (b == y)) && (1 <= y)) || ((((((2 <= counter) && (x == r)) && (1 <= r)) && ((r + ((__int128) a * y)) == (b + x))) && (q == 0)) && (1 <= y))) || (((((((a == 1) && ((y + r) == (b + x))) && (1 <= r)) && (b == y)) && (q == 0)) && (counter == 1)) && (1 <= y))) && (\old(counter) == 0)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((\old(counter) == 0) && (((((2 <= counter) && ((((__int128) q * y) + r) == x)) && (((((__int128) q * y) + r) + ((__int128) a * y)) == (b + x))) && (1 <= y)) || ((((((a == 0) && (x == r)) && (b == 0)) && (counter == 0)) && (q == 0)) && (1 <= y)))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((\old(cond) != 0) && (counter == 0)) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-12 15:46:53,309 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