./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2a54f54b02d2bb65a6f46eeae11edba1907f4f082d2aaa313102e422e7e6122 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 09:42:32,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 09:42:32,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 09:42:32,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 09:42:32,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 09:42:32,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 09:42:32,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 09:42:32,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 09:42:32,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 09:42:32,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 09:42:32,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 09:42:32,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 09:42:32,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 09:42:32,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 09:42:32,789 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 09:42:32,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 09:42:32,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 09:42:32,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 09:42:32,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 09:42:32,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 09:42:32,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 09:42:32,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 09:42:32,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 09:42:32,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 09:42:32,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 09:42:32,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 09:42:32,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 09:42:32,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 09:42:32,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 09:42:32,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 09:42:32,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 09:42:32,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 09:42:32,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 09:42:32,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 09:42:32,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 09:42:32,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 09:42:32,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 09:42:32,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 09:42:32,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 09:42:32,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 09:42:32,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 09:42:32,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 09:42:32,802 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 -> b2a54f54b02d2bb65a6f46eeae11edba1907f4f082d2aaa313102e422e7e6122 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 09:42:33,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 09:42:33,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 09:42:33,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 09:42:33,109 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 09:42:33,110 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 09:42:33,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2024-09-13 09:42:34,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 09:42:34,691 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 09:42:34,692 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2024-09-13 09:42:34,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5c829d8d7/f371db29df94462d9e4a6969b7f7a3a3/FLAGcfab68b7b [2024-09-13 09:42:34,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5c829d8d7/f371db29df94462d9e4a6969b7f7a3a3 [2024-09-13 09:42:34,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 09:42:34,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 09:42:34,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 09:42:34,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 09:42:34,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 09:42:34,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 09:42:34" (1/1) ... [2024-09-13 09:42:34,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58937a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:34, skipping insertion in model container [2024-09-13 09:42:34,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 09:42:34" (1/1) ... [2024-09-13 09:42:34,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 09:42:34,941 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/ps4-ll_valuebound5.c[458,471] [2024-09-13 09:42:34,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 09:42:34,980 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 09:42:34,991 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/ps4-ll_valuebound5.c[458,471] [2024-09-13 09:42:34,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 09:42:35,018 INFO L204 MainTranslator]: Completed translation [2024-09-13 09:42:35,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35 WrapperNode [2024-09-13 09:42:35,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 09:42:35,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 09:42:35,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 09:42:35,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 09:42:35,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,041 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 09:42:35,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 09:42:35,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 09:42:35,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 09:42:35,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 09:42:35,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,072 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 09:42:35,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 09:42:35,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 09:42:35,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 09:42:35,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 09:42:35,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (1/1) ... [2024-09-13 09:42:35,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 09:42:35,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:42:35,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 09:42:35,125 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 09:42:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 09:42:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 09:42:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 09:42:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 09:42:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 09:42:35,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 09:42:35,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 09:42:35,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 09:42:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 09:42:35,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 09:42:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 09:42:35,174 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 09:42:35,239 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 09:42:35,241 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 09:42:35,381 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 09:42:35,381 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 09:42:35,408 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 09:42:35,408 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 09:42:35,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:42:35 BoogieIcfgContainer [2024-09-13 09:42:35,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 09:42:35,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 09:42:35,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 09:42:35,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 09:42:35,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 09:42:34" (1/3) ... [2024-09-13 09:42:35,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693c3992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 09:42:35, skipping insertion in model container [2024-09-13 09:42:35,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:42:35" (2/3) ... [2024-09-13 09:42:35,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693c3992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 09:42:35, skipping insertion in model container [2024-09-13 09:42:35,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:42:35" (3/3) ... [2024-09-13 09:42:35,421 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound5.c [2024-09-13 09:42:35,439 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 09:42:35,440 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 09:42:35,516 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 09:42:35,526 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;@69d3e6a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 09:42:35,526 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 09:42:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 09:42:35,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 09:42:35,537 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:42:35,538 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:42:35,538 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:42:35,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:42:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1238311395, now seen corresponding path program 1 times [2024-09-13 09:42:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:42:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186089594] [2024-09-13 09:42:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:42:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:42:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:42:35,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:42:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:42:35,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:42:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:42:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 09:42:35,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:42:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186089594] [2024-09-13 09:42:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186089594] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:42:35,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:42:35,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 09:42:35,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393464005] [2024-09-13 09:42:35,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:42:35,735 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 09:42:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:42:35,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 09:42:35,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 09:42:35,763 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 09:42:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:42:35,797 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-09-13 09:42:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 09:42:35,800 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-13 09:42:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:42:35,808 INFO L225 Difference]: With dead ends: 44 [2024-09-13 09:42:35,808 INFO L226 Difference]: Without dead ends: 22 [2024-09-13 09:42:35,813 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 09:42:35,818 INFO L434 NwaCegarLoop]: 26 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, 26 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:42:35,820 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:42:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-13 09:42:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-13 09:42:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 09:42:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-13 09:42:35,859 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2024-09-13 09:42:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:42:35,860 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-13 09:42:35,860 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 09:42:35,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:42:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-13 09:42:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 09:42:35,862 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:42:35,862 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:42:35,863 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 09:42:35,863 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:42:35,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:42:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1910922015, now seen corresponding path program 1 times [2024-09-13 09:42:35,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:42:35,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66086001] [2024-09-13 09:42:35,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:42:35,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:42:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:42:35,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519595132] [2024-09-13 09:42:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:42:35,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:42:35,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:42:35,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 09:42:35,916 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 09:42:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:42:35,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 09:42:35,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:42:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 09:42:36,080 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 09:42:36,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:42:36,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66086001] [2024-09-13 09:42:36,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:42:36,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519595132] [2024-09-13 09:42:36,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519595132] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:42:36,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:42:36,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:42:36,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310043930] [2024-09-13 09:42:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:42:36,083 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:42:36,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:42:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:42:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:42:36,084 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 09:42:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:42:36,157 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-13 09:42:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:42:36,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-13 09:42:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:42:36,159 INFO L225 Difference]: With dead ends: 33 [2024-09-13 09:42:36,159 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 09:42:36,160 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:42:36,161 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:42:36,162 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:42:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 09:42:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-13 09:42:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 09:42:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-13 09:42:36,171 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 16 [2024-09-13 09:42:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:42:36,171 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-13 09:42:36,171 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 09:42:36,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:42:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-13 09:42:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 09:42:36,172 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:42:36,172 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:42:36,190 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 09:42:36,376 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 09:42:36,377 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:42:36,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:42:36,378 INFO L85 PathProgramCache]: Analyzing trace with hash 306700420, now seen corresponding path program 1 times [2024-09-13 09:42:36,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:42:36,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881271816] [2024-09-13 09:42:36,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:42:36,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:42:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:42:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897261643] [2024-09-13 09:42:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:42:36,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:42:36,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:42:36,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 09:42:36,432 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 09:42:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:42:36,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 09:42:36,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:42:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 09:42:36,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:42:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-13 09:42:36,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:42:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881271816] [2024-09-13 09:42:36,708 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:42:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897261643] [2024-09-13 09:42:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897261643] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 09:42:36,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 09:42:36,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-13 09:42:36,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853838715] [2024-09-13 09:42:36,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:42:36,709 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:42:36,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:42:36,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:42:36,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 09:42:36,711 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 09:42:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:42:36,760 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-09-13 09:42:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:42:36,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-13 09:42:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:42:36,761 INFO L225 Difference]: With dead ends: 35 [2024-09-13 09:42:36,761 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 09:42:36,762 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-13 09:42:36,764 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:42:36,765 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:42:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 09:42:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-13 09:42:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 09:42:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-09-13 09:42:36,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 23 [2024-09-13 09:42:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:42:36,783 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-09-13 09:42:36,784 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 09:42:36,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:42:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-09-13 09:42:36,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 09:42:36,786 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:42:36,787 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:42:36,810 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 09:42:36,987 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:42:36,987 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:42:36,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:42:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 749725687, now seen corresponding path program 1 times [2024-09-13 09:42:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:42:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061257056] [2024-09-13 09:42:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:42:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:42:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:42:37,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118890680] [2024-09-13 09:42:37,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:42:37,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:42:37,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:42:37,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 09:42:37,013 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 09:42:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:42:37,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-13 09:42:37,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:42:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:42:37,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:42:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:42:37,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:42:37,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061257056] [2024-09-13 09:42:37,296 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:42:37,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118890680] [2024-09-13 09:42:37,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118890680] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:42:37,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 09:42:37,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-13 09:42:37,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341390379] [2024-09-13 09:42:37,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 09:42:37,297 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 09:42:37,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:42:37,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 09:42:37,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-13 09:42:37,300 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-13 09:42:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:42:37,438 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-09-13 09:42:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 09:42:37,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-09-13 09:42:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:42:37,440 INFO L225 Difference]: With dead ends: 45 [2024-09-13 09:42:37,441 INFO L226 Difference]: Without dead ends: 39 [2024-09-13 09:42:37,441 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-09-13 09:42:37,442 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:42:37,444 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:42:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-13 09:42:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-13 09:42:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 6 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 09:42:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-09-13 09:42:37,470 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 29 [2024-09-13 09:42:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:42:37,471 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-09-13 09:42:37,472 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-13 09:42:37,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:42:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-09-13 09:42:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-13 09:42:37,477 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:42:37,477 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:42:37,495 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 09:42:37,677 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:42:37,678 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:42:37,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:42:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash 608187154, now seen corresponding path program 2 times [2024-09-13 09:42:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:42:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023495794] [2024-09-13 09:42:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:42:37,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:42:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:42:37,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437647458] [2024-09-13 09:42:37,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 09:42:37,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:42:37,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:42:37,724 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 09:42:37,725 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 09:42:37,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 09:42:37,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 09:42:37,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-13 09:42:37,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:42:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-13 09:42:38,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:42:46,323 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ c_main_~y~0 (* c_main_~y~0 c_main_~y~0)) (+ c_main_~c~0 (* c_main_~c~0 c_main_~y~0)))) is different from false [2024-09-13 09:42:58,417 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ (* 2 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) (+ (* 2 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)))) is different from false [2024-09-13 09:43:14,486 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ (* 3 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)) (+ (* 3 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)))) is different from false [2024-09-13 09:43:30,555 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ (* c_main_~c~0 4) (* c_main_~c~0 c_main_~y~0)) (+ (* 4 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)))) is different from false [2024-09-13 09:43:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 27 not checked. [2024-09-13 09:43:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:43:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023495794] [2024-09-13 09:43:30,689 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:43:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437647458] [2024-09-13 09:43:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437647458] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:43:30,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 09:43:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2024-09-13 09:43:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678185364] [2024-09-13 09:43:30,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 09:43:30,690 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-13 09:43:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:43:30,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-13 09:43:30,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=389, Unknown=4, NotChecked=172, Total=650 [2024-09-13 09:43:30,693 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-13 09:43:35,131 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~c~0 c_main_~y~0)) (.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse2 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))))) (.cse3 (= (+ c_main_~y~0 .cse2) (+ c_main_~c~0 .cse1))) (.cse4 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)))) (and (or .cse0 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse2))) (or .cse0 .cse3) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse2)) (or .cse4 .cse3) (or .cse4 (= (+ (* 2 c_main_~y~0) .cse2) (+ (* 2 c_main_~c~0) .cse1))) (or .cse4 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse2)))))) is different from false [2024-09-13 09:43:39,143 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse2 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))))) (.cse3 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse1 (* c_main_~c~0 c_main_~y~0))) (and (or .cse0 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse2))) (or .cse3 (= (+ c_main_~y~0 .cse2) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) .cse0 (= (* c_main_~y~0 c_main_~k~0) .cse2)) (or .cse3 (= (+ (* 2 c_main_~y~0) .cse2) (+ (* 2 c_main_~c~0) .cse1))) (or .cse3 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse2)))))) is different from false [2024-09-13 09:43:43,265 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse1 (* c_main_~c~0 c_main_~y~0)) (.cse0 (* c_main_~y~0 c_main_~y~0))) (and (or (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse0 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (+ c_main_~y~0 .cse0) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse0)) (or .cse2 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse0))) (or .cse2 (= (+ (* 2 c_main_~y~0) .cse0) (+ (* 2 c_main_~c~0) .cse1))) (or .cse2 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse0))))) is different from false [2024-09-13 09:43:47,273 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse2 (* c_main_~c~0 c_main_~y~0)) (.cse1 (* c_main_~y~0 c_main_~y~0))) (and (or .cse0 (= (+ c_main_~y~0 .cse1) (+ c_main_~c~0 .cse2))) (or (< c_main_~c~0 c_main_~k~0) (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse1 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (* c_main_~y~0 c_main_~k~0) .cse1)) (or .cse0 (= (+ (* 2 c_main_~y~0) .cse1) (+ (* 2 c_main_~c~0) .cse2))) (or .cse0 (= (+ (* 3 c_main_~c~0) .cse2) (+ (* 3 c_main_~y~0) .cse1))))) is different from false [2024-09-13 09:43:51,288 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse1 (* c_main_~c~0 c_main_~y~0)) (.cse0 (* c_main_~y~0 c_main_~y~0))) (and (or (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse0 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (+ c_main_~y~0 .cse0) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse0)) (or .cse2 (= (+ (* 2 c_main_~y~0) .cse0) (+ (* 2 c_main_~c~0) .cse1))) (or .cse2 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse0))))) is different from false [2024-09-13 09:45:33,315 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 09:45:37,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 09:45:41,336 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0)) (.cse1 (* c_main_~c~0 c_main_~y~0))) (let ((.cse3 (= (+ c_main_~y~0 .cse2) (+ c_main_~c~0 .cse1))) (.cse0 (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse2 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))))) (.cse4 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)))) (and (or .cse0 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse2))) (or .cse0 .cse3) (or .cse4 .cse3) (or (< c_main_~c~0 c_main_~k~0) .cse0 (= (* c_main_~y~0 c_main_~k~0) .cse2)) (or .cse4 (= (+ (* 2 c_main_~y~0) .cse2) (+ (* 2 c_main_~c~0) .cse1)))))) is different from false [2024-09-13 09:45:45,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse0 (* c_main_~y~0 c_main_~y~0)) (.cse1 (* c_main_~c~0 c_main_~y~0))) (and (or (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse0 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (+ c_main_~y~0 .cse0) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse0)) (or .cse2 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse0))) (or .cse2 (= (+ (* 2 c_main_~y~0) .cse0) (+ (* 2 c_main_~c~0) .cse1))))) is different from false [2024-09-13 09:47:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:47:13,910 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-09-13 09:47:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-13 09:47:13,910 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 50 [2024-09-13 09:47:13,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:47:13,911 INFO L225 Difference]: With dead ends: 53 [2024-09-13 09:47:13,911 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 09:47:13,912 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 235.3s TimeCoverageRelationStatistics Valid=157, Invalid=668, Unknown=31, NotChecked=704, Total=1560 [2024-09-13 09:47:13,913 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 380 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-09-13 09:47:13,913 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 323 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 1 Unknown, 380 Unchecked, 4.2s Time] [2024-09-13 09:47:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 09:47:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 09:47:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 09:47:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 09:47:13,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-09-13 09:47:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:47:13,915 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 09:47:13,915 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-13 09:47:13,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:47:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 09:47:13,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 09:47:13,918 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 09:47:13,932 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 09:47:14,119 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:47:14,123 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-09-13 09:47:14,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 09:47:14,622 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 09:47:14,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 09:47:14 BoogieIcfgContainer [2024-09-13 09:47:14,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 09:47:14,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 09:47:14,640 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 09:47:14,640 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 09:47:14,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:42:35" (3/4) ... [2024-09-13 09:47:14,642 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 09:47:14,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 09:47:14,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-13 09:47:14,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 09:47:14,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-13 09:47:14,649 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-13 09:47:14,650 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-13 09:47:14,650 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-13 09:47:14,650 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 09:47:14,737 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 09:47:14,738 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 09:47:14,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 09:47:14,739 INFO L158 Benchmark]: Toolchain (without parser) took 280006.78ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 104.9MB in the beginning and 122.0MB in the end (delta: -17.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-09-13 09:47:14,739 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 09:47:14,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.87ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 93.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 09:47:14,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.45ms. Allocated memory is still 161.5MB. Free memory was 93.4MB in the beginning and 92.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 09:47:14,740 INFO L158 Benchmark]: Boogie Preprocessor took 43.28ms. Allocated memory is still 161.5MB. Free memory was 92.3MB in the beginning and 90.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 09:47:14,741 INFO L158 Benchmark]: RCFGBuilder took 322.93ms. Allocated memory is still 161.5MB. Free memory was 90.5MB in the beginning and 78.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 09:47:14,741 INFO L158 Benchmark]: TraceAbstraction took 279226.40ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 77.7MB in the beginning and 126.2MB in the end (delta: -48.5MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2024-09-13 09:47:14,741 INFO L158 Benchmark]: Witness Printer took 98.25ms. Allocated memory is still 205.5MB. Free memory was 126.2MB in the beginning and 122.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 09:47:14,743 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.87ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 93.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.45ms. Allocated memory is still 161.5MB. Free memory was 93.4MB in the beginning and 92.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.28ms. Allocated memory is still 161.5MB. Free memory was 92.3MB in the beginning and 90.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 322.93ms. Allocated memory is still 161.5MB. Free memory was 90.5MB in the beginning and 78.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 279226.40ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 77.7MB in the beginning and 126.2MB in the end (delta: -48.5MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * Witness Printer took 98.25ms. Allocated memory is still 205.5MB. Free memory was 126.2MB in the beginning and 122.0MB 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.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: 12]: 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 278.6s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 223.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 584 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 380 IncrementalHoareTripleChecker+Unchecked, 477 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 107 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 179 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 235.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 53.5s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 1170 SizeOfPredicates, 9 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 102/190 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: 27]: Loop Invariant Derived loop invariant: (((((c + ((__int128) c * y)) == (y + ((__int128) y * y))) && ((((__int128) c * 2) + ((__int128) c * y)) == (((__int128) y * 2) + ((__int128) y * y)))) && (((((((__int128) y * y) * y) * y) + ((__int128) y * y)) + ((((__int128) y * y) * y) * 2)) == ((__int128) x * 4))) && ((c < k) || (((__int128) y * y) == ((__int128) k * y)))) - ProcedureContractResult [Line: 9]: 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 09:47:14,867 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE