./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound2.i --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 5189fb62 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/divbin_valuebound2.i -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 1f6ee705374b9304c4ad35807ad9bde4a154c7f85315159d7da4519e0aae9554 --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-5189fb6-m [2024-09-13 00:11:41,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 00:11:41,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 00:11:41,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 00:11:41,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 00:11:41,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 00:11:41,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 00:11:41,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 00:11:41,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 00:11:41,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 00:11:41,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 00:11:41,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 00:11:41,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 00:11:41,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 00:11:41,716 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 00:11:41,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 00:11:41,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 00:11:41,718 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 00:11:41,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 00:11:41,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 00:11:41,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 00:11:41,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 00:11:41,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 00:11:41,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 00:11:41,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 00:11:41,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 00:11:41,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 00:11:41,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 00:11:41,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 00:11:41,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 00:11:41,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 00:11:41,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 00:11:41,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:11:41,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 00:11:41,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 00:11:41,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 00:11:41,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 00:11:41,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 00:11:41,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 00:11:41,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 00:11:41,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 00:11:41,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 00:11:41,725 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 -> 1f6ee705374b9304c4ad35807ad9bde4a154c7f85315159d7da4519e0aae9554 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 00:11:41,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 00:11:41,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 00:11:41,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 00:11:41,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 00:11:41,999 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 00:11:42,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound2.i [2024-09-13 00:11:43,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 00:11:43,583 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 00:11:43,583 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound2.i [2024-09-13 00:11:43,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4685cfa11/432e83b943e54d1ca662d93d46ff0cac/FLAG2f004babb [2024-09-13 00:11:43,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4685cfa11/432e83b943e54d1ca662d93d46ff0cac [2024-09-13 00:11:44,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 00:11:44,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 00:11:44,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 00:11:44,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 00:11:44,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 00:11:44,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:11:43" (1/1) ... [2024-09-13 00:11:44,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c2b20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44, skipping insertion in model container [2024-09-13 00:11:44,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:11:43" (1/1) ... [2024-09-13 00:11:44,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 00:11:44,171 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/divbin_valuebound2.i[950,963] [2024-09-13 00:11:44,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:11:44,192 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 00:11:44,204 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/divbin_valuebound2.i[950,963] [2024-09-13 00:11:44,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:11:44,226 INFO L204 MainTranslator]: Completed translation [2024-09-13 00:11:44,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44 WrapperNode [2024-09-13 00:11:44,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 00:11:44,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 00:11:44,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 00:11:44,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 00:11:44,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,248 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 00:11:44,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 00:11:44,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 00:11:44,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 00:11:44,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 00:11:44,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,275 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 00:11:44,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 00:11:44,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 00:11:44,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 00:11:44,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 00:11:44,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (1/1) ... [2024-09-13 00:11:44,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:11:44,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:11:44,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 00:11:44,329 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 00:11:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 00:11:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 00:11:44,376 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 00:11:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 00:11:44,376 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 00:11:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 00:11:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 00:11:44,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 00:11:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 00:11:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 00:11:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 00:11:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 00:11:44,442 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 00:11:44,444 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 00:11:44,625 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 00:11:44,626 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 00:11:44,652 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 00:11:44,653 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 00:11:44,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:11:44 BoogieIcfgContainer [2024-09-13 00:11:44,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 00:11:44,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 00:11:44,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 00:11:44,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 00:11:44,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 12:11:43" (1/3) ... [2024-09-13 00:11:44,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c23b619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:11:44, skipping insertion in model container [2024-09-13 00:11:44,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:11:44" (2/3) ... [2024-09-13 00:11:44,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c23b619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:11:44, skipping insertion in model container [2024-09-13 00:11:44,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:11:44" (3/3) ... [2024-09-13 00:11:44,664 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound2.i [2024-09-13 00:11:44,681 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 00:11:44,681 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 00:11:44,745 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 00:11:44,751 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;@252319fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 00:11:44,751 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 00:11:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 00:11:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-13 00:11:44,765 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:11:44,766 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:11:44,766 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:11:44,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:11:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash -923394275, now seen corresponding path program 1 times [2024-09-13 00:11:44,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:11:44,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82499854] [2024-09-13 00:11:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:11:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:11:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:44,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:11:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:44,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:11:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:44,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:11:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:44,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:11:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:44,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:11:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:11:44,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:11:44,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82499854] [2024-09-13 00:11:44,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82499854] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:11:44,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:11:44,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 00:11:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3706991] [2024-09-13 00:11:44,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:11:44,959 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 00:11:44,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:11:44,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 00:11:44,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:11:44,979 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 00:11:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:11:45,004 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2024-09-13 00:11:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 00:11:45,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-13 00:11:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:11:45,012 INFO L225 Difference]: With dead ends: 58 [2024-09-13 00:11:45,012 INFO L226 Difference]: Without dead ends: 28 [2024-09-13 00:11:45,015 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:11:45,018 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:11:45,018 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:11:45,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-13 00:11:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-13 00:11:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 00:11:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-13 00:11:45,052 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 33 [2024-09-13 00:11:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:11:45,053 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-13 00:11:45,053 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 00:11:45,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:11:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-13 00:11:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-13 00:11:45,056 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:11:45,056 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:11:45,056 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 00:11:45,056 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:11:45,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:11:45,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1193042891, now seen corresponding path program 1 times [2024-09-13 00:11:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:11:45,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126439997] [2024-09-13 00:11:45,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:11:45,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:11:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:11:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161467787] [2024-09-13 00:11:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:11:45,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:11:45,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:11:45,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:11:45,140 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 00:11:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:45,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-13 00:11:45,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:11:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-13 00:11:45,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:11:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:11:45,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:11:45,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126439997] [2024-09-13 00:11:45,676 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:11:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161467787] [2024-09-13 00:11:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161467787] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 00:11:45,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:11:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-09-13 00:11:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754463780] [2024-09-13 00:11:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:11:45,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 00:11:45,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:11:45,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 00:11:45,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-13 00:11:45,683 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 00:11:49,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-09-13 00:11:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:11:49,819 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-09-13 00:11:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 00:11:49,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2024-09-13 00:11:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:11:49,822 INFO L225 Difference]: With dead ends: 38 [2024-09-13 00:11:49,822 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 00:11:49,822 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-13 00:11:49,823 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-09-13 00:11:49,824 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-09-13 00:11:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 00:11:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-13 00:11:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 00:11:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-13 00:11:49,834 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 34 [2024-09-13 00:11:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:11:49,835 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-13 00:11:49,836 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 00:11:49,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:11:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-13 00:11:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-13 00:11:49,837 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:11:49,838 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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-13 00:11:49,855 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 00:11:50,039 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:11:50,039 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:11:50,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:11:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash 513117096, now seen corresponding path program 1 times [2024-09-13 00:11:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:11:50,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196676845] [2024-09-13 00:11:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:11:50,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:11:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:50,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:11:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:50,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:11:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:50,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:11:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:50,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:11:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:50,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:11:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:50,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 00:11:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:11:50,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:11:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196676845] [2024-09-13 00:11:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196676845] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:11:50,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:11:50,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 00:11:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598233613] [2024-09-13 00:11:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:11:50,732 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 00:11:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:11:50,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 00:11:50,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 00:11:50,735 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 00:11:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:11:50,784 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-09-13 00:11:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 00:11:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-09-13 00:11:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:11:50,786 INFO L225 Difference]: With dead ends: 51 [2024-09-13 00:11:50,786 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 00:11:50,787 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 00:11:50,788 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:11:50,790 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:11:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 00:11:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-13 00:11:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 00:11:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-13 00:11:50,806 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2024-09-13 00:11:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:11:50,806 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-13 00:11:50,808 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 00:11:50,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:11:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-13 00:11:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-13 00:11:50,810 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:11:50,811 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:11:50,811 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 00:11:50,811 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:11:50,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:11:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash 980542403, now seen corresponding path program 1 times [2024-09-13 00:11:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:11:50,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865028141] [2024-09-13 00:11:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:11:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:11:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:11:50,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809766718] [2024-09-13 00:11:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:11:50,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:11:50,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:11:50,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:11:50,848 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 00:11:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:11:50,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 00:11:50,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:11:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-13 00:11:51,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:12:16,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:12:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865028141] [2024-09-13 00:12:16,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:12:16,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809766718] [2024-09-13 00:12:16,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809766718] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:12:16,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:12:16,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-09-13 00:12:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770043791] [2024-09-13 00:12:16,415 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-13 00:12:16,415 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-13 00:12:16,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:12:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-13 00:12:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=195, Unknown=4, NotChecked=0, Total=240 [2024-09-13 00:12:16,416 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 00:12:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:12:16,671 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-09-13 00:12:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 00:12:16,672 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-09-13 00:12:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:12:16,673 INFO L225 Difference]: With dead ends: 52 [2024-09-13 00:12:16,675 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 00:12:16,676 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=47, Invalid=221, Unknown=4, NotChecked=0, Total=272 [2024-09-13 00:12:16,677 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 00:12:16,677 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 159 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 00:12:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 00:12:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-09-13 00:12:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 00:12:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-13 00:12:16,695 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 44 [2024-09-13 00:12:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:12:16,695 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-13 00:12:16,695 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 00:12:16,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:12:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-13 00:12:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-13 00:12:16,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:12:16,697 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:12:16,705 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-13 00:12:16,897 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-13 00:12:16,898 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:12:16,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:12:16,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2109238368, now seen corresponding path program 2 times [2024-09-13 00:12:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:12:16,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593809883] [2024-09-13 00:12:16,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:12:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:12:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:17,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:12:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:17,440 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:12:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:17,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:12:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:17,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:12:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:17,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:12:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:17,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 00:12:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:17,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 00:12:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-13 00:12:17,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:12:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593809883] [2024-09-13 00:12:17,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593809883] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:12:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208369425] [2024-09-13 00:12:17,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 00:12:17,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:12:17,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:12:17,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:12:17,493 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 00:12:17,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 00:12:17,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:12:17,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-13 00:12:17,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:12:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 00:12:18,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:12:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 00:12:19,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208369425] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:12:19,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 00:12:19,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 10] total 23 [2024-09-13 00:12:19,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293041746] [2024-09-13 00:12:19,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 00:12:19,598 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-13 00:12:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:12:19,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-13 00:12:19,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-09-13 00:12:19,600 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 20 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-13 00:12:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:12:21,369 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2024-09-13 00:12:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-13 00:12:21,370 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 20 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) Word has length 52 [2024-09-13 00:12:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:12:21,373 INFO L225 Difference]: With dead ends: 103 [2024-09-13 00:12:21,373 INFO L226 Difference]: Without dead ends: 68 [2024-09-13 00:12:21,374 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2024-09-13 00:12:21,376 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 49 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-13 00:12:21,377 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 261 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-13 00:12:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-13 00:12:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2024-09-13 00:12:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 00:12:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-09-13 00:12:21,408 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 52 [2024-09-13 00:12:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:12:21,408 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-09-13 00:12:21,409 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 20 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-13 00:12:21,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:12:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-09-13 00:12:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 00:12:21,412 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:12:21,412 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:12:21,420 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 00:12:21,613 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-13 00:12:21,613 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:12:21,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:12:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -860568069, now seen corresponding path program 3 times [2024-09-13 00:12:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:12:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108876880] [2024-09-13 00:12:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:12:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:12:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:29,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:12:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:29,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:12:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:29,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:12:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:29,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:12:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:29,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:12:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:29,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-13 00:12:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:29,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 00:12:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:12:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 00:12:29,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:12:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108876880] [2024-09-13 00:12:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108876880] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:12:29,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123739274] [2024-09-13 00:12:29,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 00:12:29,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:12:29,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:12:29,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:12:29,422 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 00:12:29,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 00:12:29,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:12:29,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-13 00:12:29,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:12:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 00:12:32,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:14:57,386 WARN L293 SmtUtils]: Spent 14.37s on a formula simplification that was a NOOP. DAG size: 418 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:15:35,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123739274] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:15:35,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:15:35,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 25 [2024-09-13 00:15:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170541496] [2024-09-13 00:15:35,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:15:35,859 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-13 00:15:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:15:35,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-13 00:15:35,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1148, Unknown=13, NotChecked=0, Total=1332 [2024-09-13 00:15:35,860 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 21 states have internal predecessors, (45), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-13 00:15:45,624 WARN L293 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 124 DAG size of output: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:15:49,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:15:52,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:15:55,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:16:01,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:16:06,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:16:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:16:16,523 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2024-09-13 00:16:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-13 00:16:16,523 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 21 states have internal predecessors, (45), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 54 [2024-09-13 00:16:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:16:16,524 INFO L225 Difference]: With dead ends: 104 [2024-09-13 00:16:16,524 INFO L226 Difference]: Without dead ends: 68 [2024-09-13 00:16:16,526 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 127.4s TimeCoverageRelationStatistics Valid=441, Invalid=2301, Unknown=14, NotChecked=0, Total=2756 [2024-09-13 00:16:16,526 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 88 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:16:16,527 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 397 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 21.0s Time] [2024-09-13 00:16:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-13 00:16:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 50. [2024-09-13 00:16:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 00:16:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-09-13 00:16:16,565 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 54 [2024-09-13 00:16:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:16:16,566 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-09-13 00:16:16,566 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 21 states have internal predecessors, (45), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-13 00:16:16,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:16:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-09-13 00:16:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 00:16:16,567 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:16:16,567 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:16:16,576 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 00:16:16,768 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:16:16,768 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:16:16,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:16:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash -803309767, now seen corresponding path program 1 times [2024-09-13 00:16:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:16:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388803449] [2024-09-13 00:16:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:16:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:16:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:16:16,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713264968] [2024-09-13 00:16:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:16:16,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:16:16,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:16:16,843 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:16:16,845 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 00:16:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:16:16,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-13 00:16:16,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:16:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-13 00:16:17,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:16:35,017 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~r~0 4294967296)) (.cse3 (mod c_main_~B~0 4294967296)) (.cse2 (mod c_main_~A~0 4294967296))) (let ((.cse4 (+ .cse2 2)) (.cse6 (< .cse0 (+ .cse3 1)))) (and (forall ((v_y_144 Int)) (let ((.cse1 (* 2 v_y_144))) (or (< .cse0 .cse1) (< .cse2 (+ (* (mod (+ v_y_144 (* c_main_~q~0 2 v_y_144)) 2147483648) 2) 1)) (< .cse3 (+ .cse1 1)) (< v_y_144 1)))) (forall ((v_y_143 Int)) (let ((.cse5 (* 2 v_y_143))) (or (< (+ (* 2 (mod (+ (* c_main_~q~0 2 v_y_143) v_y_143) 2147483648)) v_y_143) .cse4) (< .cse0 .cse5) (< .cse3 (+ .cse5 1)) (< v_y_143 0)))) (or .cse6 (forall ((v_y_143 Int)) (let ((.cse7 (* 2 v_y_143))) (or (< (+ (* 2 (mod (+ (* c_main_~q~0 2 v_y_143) v_y_143) 2147483648)) v_y_143) .cse4) (< .cse0 .cse7) (< .cse7 .cse3))))) (or .cse6 (forall ((v_y_144 Int)) (let ((.cse8 (* 2 v_y_144))) (or (< .cse0 .cse8) (< .cse8 .cse3) (< .cse2 (+ (* (mod (+ v_y_144 (* c_main_~q~0 2 v_y_144)) 2147483648) 2) 1)) (< v_y_144 1)))))))) is different from false [2024-09-13 00:16:40,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:16:40,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388803449] [2024-09-13 00:16:40,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:16:40,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713264968] [2024-09-13 00:16:40,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713264968] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:16:40,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:16:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-09-13 00:16:40,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950739669] [2024-09-13 00:16:40,470 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-13 00:16:40,470 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-13 00:16:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:16:40,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-13 00:16:40,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=348, Unknown=2, NotChecked=38, Total=462 [2024-09-13 00:16:40,471 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-13 00:16:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:16:40,796 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-09-13 00:16:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-13 00:16:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2024-09-13 00:16:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:16:40,799 INFO L225 Difference]: With dead ends: 64 [2024-09-13 00:16:40,799 INFO L226 Difference]: Without dead ends: 61 [2024-09-13 00:16:40,799 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=99, Invalid=455, Unknown=2, NotChecked=44, Total=600 [2024-09-13 00:16:40,800 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 00:16:40,801 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 190 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 00:16:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-13 00:16:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-09-13 00:16:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 00:16:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-09-13 00:16:40,827 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 54 [2024-09-13 00:16:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:16:40,827 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-09-13 00:16:40,828 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-13 00:16:40,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:16:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-09-13 00:16:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-13 00:16:40,829 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:16:40,829 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:16:40,836 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-13 00:16:41,029 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 00:16:41,030 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:16:41,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:16:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1329352982, now seen corresponding path program 2 times [2024-09-13 00:16:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:16:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735803250] [2024-09-13 00:16:41,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:16:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:16:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:16:49,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:16:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:16:49,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:16:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:16:49,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:16:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:16:49,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:16:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:16:49,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:16:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:16:49,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-13 00:16:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:16:49,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 00:16:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:16:49,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 00:16:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:16:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-13 00:16:49,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:16:49,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735803250] [2024-09-13 00:16:49,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735803250] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:16:49,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879067864] [2024-09-13 00:16:49,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 00:16:49,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:16:49,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:16:49,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:16:49,644 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-13 00:16:49,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 00:16:49,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:16:49,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-13 00:16:49,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:16:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-13 00:16:51,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:16:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-13 00:16:53,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879067864] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:16:53,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 00:16:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 35 [2024-09-13 00:16:53,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241446536] [2024-09-13 00:16:53,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 00:16:53,963 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-13 00:16:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:16:53,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-13 00:16:53,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2024-09-13 00:16:53,965 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 31 states have internal predecessors, (67), 15 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22) [2024-09-13 00:17:01,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:17:03,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:17:07,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:17:11,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:17:15,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:17:19,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:17:23,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:17:26,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:17:28,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:17:32,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:17:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:17:37,146 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2024-09-13 00:17:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 00:17:37,147 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 31 states have internal predecessors, (67), 15 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22) Word has length 62 [2024-09-13 00:17:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:17:37,148 INFO L225 Difference]: With dead ends: 80 [2024-09-13 00:17:37,148 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 00:17:37,149 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=250, Invalid=1471, Unknown=1, NotChecked=0, Total=1722 [2024-09-13 00:17:37,149 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 79 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 25 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2024-09-13 00:17:37,149 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 415 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 341 Invalid, 7 Unknown, 0 Unchecked, 35.6s Time] [2024-09-13 00:17:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 00:17:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 00:17:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 00:17:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 00:17:37,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2024-09-13 00:17:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:17:37,151 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 00:17:37,151 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 31 states have internal predecessors, (67), 15 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22) [2024-09-13 00:17:37,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:17:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 00:17:37,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 00:17:37,154 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 00:17:37,172 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-13 00:17:37,355 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:17:37,358 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-09-13 00:17:37,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 00:18:02,008 WARN L293 SmtUtils]: Spent 24.48s on a formula simplification. DAG size of input: 236 DAG size of output: 143 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-13 00:18:45,958 WARN L293 SmtUtils]: Spent 42.34s on a formula simplification. DAG size of input: 253 DAG size of output: 164 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-13 00:20:15,241 WARN L293 SmtUtils]: Spent 1.49m on a formula simplification. DAG size of input: 253 DAG size of output: 164 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-13 00:21:51,864 WARN L293 SmtUtils]: Spent 1.61m on a formula simplification. DAG size of input: 193 DAG size of output: 155 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-13 00:23:51,232 WARN L293 SmtUtils]: Spent 1.99m on a formula simplification. DAG size of input: 193 DAG size of output: 161 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-13 00:23:51,236 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 00:23:51,252 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-13 00:23:51,254 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-13 00:23:51,258 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-13 00:23:51,270 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-13 00:23:51,277 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-13 00:23:51,278 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-13 00:23:51,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 12:23:51 BoogieIcfgContainer [2024-09-13 00:23:51,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 00:23:51,295 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 00:23:51,295 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 00:23:51,296 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 00:23:51,296 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:11:44" (3/4) ... [2024-09-13 00:23:51,300 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 00:23:51,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 00:23:51,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-13 00:23:51,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 00:23:51,305 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-13 00:23:51,309 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-13 00:23:51,310 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-13 00:23:51,310 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-13 00:23:51,310 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 00:23:51,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 00:23:51,400 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 00:23:51,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 00:23:51,400 INFO L158 Benchmark]: Toolchain (without parser) took 727399.58ms. Allocated memory was 125.8MB in the beginning and 293.6MB in the end (delta: 167.8MB). Free memory was 96.1MB in the beginning and 217.8MB in the end (delta: -121.7MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-09-13 00:23:51,401 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 125.8MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 00:23:51,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.91ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 95.9MB in the beginning and 128.5MB in the end (delta: -32.6MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-09-13 00:23:51,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.23ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 127.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 00:23:51,402 INFO L158 Benchmark]: Boogie Preprocessor took 39.03ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 125.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 00:23:51,402 INFO L158 Benchmark]: RCFGBuilder took 365.16ms. Allocated memory is still 167.8MB. Free memory was 125.8MB in the beginning and 112.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 00:23:51,402 INFO L158 Benchmark]: TraceAbstraction took 726638.06ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 112.4MB in the beginning and 222.0MB in the end (delta: -109.6MB). Peak memory consumption was 154.3MB. Max. memory is 16.1GB. [2024-09-13 00:23:51,402 INFO L158 Benchmark]: Witness Printer took 104.58ms. Allocated memory is still 293.6MB. Free memory was 222.0MB in the beginning and 217.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 00:23:51,404 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 125.8MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.91ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 95.9MB in the beginning and 128.5MB in the end (delta: -32.6MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.23ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 127.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.03ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 125.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 365.16ms. Allocated memory is still 167.8MB. Free memory was 125.8MB in the beginning and 112.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 726638.06ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 112.4MB in the beginning and 222.0MB in the end (delta: -109.6MB). Peak memory consumption was 154.3MB. Max. memory is 16.1GB. * Witness Printer took 104.58ms. Allocated memory is still 293.6MB. Free memory was 222.0MB in the beginning and 217.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 21]: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 352.6s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 90.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 61.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 1615 SdHoareTripleChecker+Invalid, 61.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1399 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1495 IncrementalHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 216 mSDtfsCounter, 1495 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 472 SyntacticMatches, 9 SemanticMatches, 171 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 179.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=5, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 259.1s InterpolantComputationTime, 675 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 677 ConstructedInterpolants, 4 QuantifiedInterpolants, 8416 SizeOfPredicates, 22 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 436/592 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: 37]: Loop Invariant Derived loop invariant: (((((((((B % 4294967296) <= (r % 4294967296)) && ((((((long long) B * 2) + r) + (8589934592 * (b / 4294967296))) + (4294967296 * ((((((((A / 4294967296) * -(((__int128) 0 << 64) | 12297829383904690176U)) + ((unsigned long long) (((long long) b + 1) / 2) * 4294967296)) + 3074457341323291305) + ((unsigned long long) 2863311531 * r)) + ((__int128) -5010795179 * b)) + ((__int128) B * 5726623062)) / 3074457347049914368))) <= (((((8589934592 * (((((((long long) B * -6) + 6) + ((long long) r * -3)) + ((A / 4294967296) * 12884901888)) + ((long long) b * 3)) / 8589934592)) + b) + 2) + ((A / 4294967296) * 4294967296)) + (17179869184 * (B / 4294967296))))) && (1 <= (B % 4294967296))) && ((((long long) B * 2) + ((A / 4294967296) * 3074457342754947072)) <= (((long long) r * 715827882) + b))) && (q == 0)) && (((long long) B * 2) == b)) || (((((((((long long) B * 2) + r) <= ((2 + ((A / 4294967296) * 4294967296)) + ((long long) b * 2))) && (B == b)) && (1 <= (B % 4294967296))) && (b <= (2 + ((B / 4294967296) * 4294967296)))) && ((((A / 4294967296) * 1537228671377473536) + B) <= (b + ((long long) r * 357913941)))) && (q == 0))) || (((((((((B % 2147483648) * 2) <= (r % 4294967296)) && (((B + ((r / 4294967296) * 4294967296)) + ((((((((long long) 1073741824 * r) + (((((int) -1 * (b / 2)) + 1) / 2) * 2147483648)) + 1537228670661645652) + ((unsigned long long) 2863311531 * B)) + ((A / 4294967296) * -6148914691952345088)) / 1537228673524957184) * 2147483648)) <= ((((((A / 4294967296) * 2147483648) + ((b / 4294967296) * 4294967296)) + ((((((-6442450944 * (r / 4294967296)) + 3) + ((A / 4294967296) * 6442450944)) + ((long long) B * -3)) / 4294967296) * 4294967296)) + ((B / 4294967296) * 4294967296)) + 1))) && (b <= ((long long) B * 4))) && (((b / 4294967296) * 4294967296) <= (((((long long) B * 2) + (b / 2)) + (((-1 + ((long long) -1 * r)) / 2) * 2)) + ((r / 4294967296) * 4294967296)))) && (q == 0)) && ((((long long) B * 2) + ((A / 4294967296) * 3074457342754947072)) <= (((long long) r * 715827882) + (b / 2)))) && (((17179869184 * (r / 4294967296)) + ((long long) b * 3)) <= ((((4294967292 + ((b / 4294967296) * 21474836480)) + (8589934592 * ((((((((((((4294967292 + ((long long) b * -3)) + (2 * (b / 2))) + ((b / 4294967296) * 21474836480)) + (-17179869184 * (r / 4294967296))) + ((long long) B * -4)) + (17179869184 * (B / 4294967296))) + ((long long) r * 4)) / 12884901888) * -6442450944) + ((long long) -2 * B)) + (b / 2)) / 4294967296))) + (17179869184 * (B / 4294967296))) + ((long long) r * 4))))) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((((((B % 4294967296) <= 2) && (q == 0)) && (((long long) (r % 4294967296) + 1) <= (b % 4294967296))) && (((long long) B * 2) == b)) && ((r % 4294967296) <= 2)) || ((((((((b + r) % 4294967296) == (A % 4294967296)) && ((B + (((((((((long long) 1073741824 * r) + ((long long) -2147483648 * (b / 2))) + ((long long) 1073741824 * b)) + 1537228670661645652) + ((unsigned long long) 2863311531 * B)) + (-1073741824 * (((((long long) r * 715827882) + ((long long) 715827883 * b)) + ((long long) -2 * B)) / 2147483648))) / 1537228673524957184) * 2147483648)) <= (((((B / 4294967296) * 34359738368) + ((b / 4294967296) * 4294967296)) + (((((long long) r + 3) + ((long long) B * -3)) / 4294967296) * 4294967296)) + 1))) && (((b + r) % 4294967296) <= (2 + ((((b + r) % 4294967296) / 4294967296) * 4294967296)))) && (1 <= (B % 4294967296))) && (q == 1)) && (b <= 2147483646))) || (((((((b == 1) && ((r % 4294967296) <= 0)) && (q == 2)) && ((((A / 4294967296) * 4294967296) + ((long long) B * 4)) <= (((long long) A + 8) + (17179869184 * (B / 4294967296))))) && ((A % 4294967296) == 2)) && (1 <= (B % 4294967296))) && ((B % 2147483648) <= 1))) || ((((((((long long) (r % 4294967296) + 1) <= ((B % 2147483648) * 2)) && ((B % 4294967296) <= 2)) && ((r % 4294967296) == (A % 4294967296))) && ((B % 2147483648) == b)) && (q == 0)) && ((r % 4294967296) <= 2))) || ((((b + ((B / 4294967296) * 4294967296)) == (B + ((b / 4294967296) * 4294967296))) && ((B / 4294967296) <= (b / 4294967296))) && (((A / 4294967296) + (b / 4294967296)) <= ((r / 4294967296) + (B / 4294967296))))) || (((((((b + ((B / 4294967296) * 4294967296)) == (B + ((b / 4294967296) * 4294967296))) && (((b + r) % 4294967296) == (A % 4294967296))) && ((B % 4294967296) <= 2)) && (1 <= (B % 4294967296))) && (q == 1)) && ((A % 4294967296) <= 2))) || ((((((((((B % 2147483648) * 2) <= (r % 4294967296)) && (((B + ((r / 4294967296) * 4294967296)) + ((((((((long long) 1073741824 * r) + (((((int) -1 * (b / 2)) + 1) / 2) * 2147483648)) + 1537228670661645652) + ((unsigned long long) 2863311531 * B)) + ((A / 4294967296) * -6148914691952345088)) / 1537228673524957184) * 2147483648)) <= ((((((A / 4294967296) * 2147483648) + ((b / 4294967296) * 4294967296)) + ((((((-6442450944 * (r / 4294967296)) + 3) + ((A / 4294967296) * 6442450944)) + ((long long) B * -3)) / 4294967296) * 4294967296)) + ((B / 4294967296) * 4294967296)) + 1))) && (1 <= (B % 4294967296))) && (b <= ((long long) B * 4))) && (q == 0)) && ((((long long) B * 2) + ((A / 4294967296) * 3074457342754947072)) <= (((long long) r * 715827882) + (b / 2)))) && ((r % 4294967296) <= 2)) && (((17179869184 * (r / 4294967296)) + ((long long) b * 3)) <= ((((4294967292 + ((b / 4294967296) * 21474836480)) + (8589934592 * ((((((((((((4294967292 + ((long long) b * -3)) + (2 * (b / 2))) + ((b / 4294967296) * 21474836480)) + (-17179869184 * (r / 4294967296))) + ((long long) B * -4)) + (17179869184 * (B / 4294967296))) + ((long long) r * 4)) / 12884901888) * -6442450944) + ((long long) -2 * B)) + (b / 2)) / 4294967296))) + (17179869184 * (B / 4294967296))) + ((long long) r * 4))))) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-13 00:23:51,619 WARN L435 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-09-13 00:23:51,707 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE