./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/geo1-ll_unwindbound2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e090762371efa1a10feb6b828109be17ddc5665dc90c03c64afd7f0f5af02942 --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:20:31,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 09:20:31,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 09:20:31,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 09:20:31,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 09:20:31,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 09:20:31,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 09:20:31,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 09:20:31,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 09:20:31,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 09:20:31,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 09:20:31,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 09:20:31,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 09:20:31,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 09:20:31,154 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 09:20:31,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 09:20:31,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 09:20:31,156 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 09:20:31,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 09:20:31,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 09:20:31,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 09:20:31,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 09:20:31,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 09:20:31,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 09:20:31,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 09:20:31,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 09:20:31,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 09:20:31,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 09:20:31,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 09:20:31,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 09:20:31,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 09:20:31,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 09:20:31,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 09:20:31,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 09:20:31,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 09:20:31,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 09:20:31,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 09:20:31,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 09:20:31,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 09:20:31,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 09:20:31,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 09:20:31,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 09:20:31,164 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 -> e090762371efa1a10feb6b828109be17ddc5665dc90c03c64afd7f0f5af02942 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:20:31,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 09:20:31,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 09:20:31,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 09:20:31,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 09:20:31,359 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 09:20:31,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c [2024-09-13 09:20:32,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 09:20:32,697 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 09:20:32,699 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c [2024-09-13 09:20:32,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c814f91ed/a2b68c29227d4c0fba2d9ba4a34bca45/FLAG8508f9136 [2024-09-13 09:20:33,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c814f91ed/a2b68c29227d4c0fba2d9ba4a34bca45 [2024-09-13 09:20:33,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 09:20:33,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 09:20:33,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 09:20:33,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 09:20:33,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 09:20:33,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a36ee00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33, skipping insertion in model container [2024-09-13 09:20:33,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 09:20:33,254 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/geo1-ll_unwindbound2.c[546,559] [2024-09-13 09:20:33,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 09:20:33,277 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 09:20:33,289 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/geo1-ll_unwindbound2.c[546,559] [2024-09-13 09:20:33,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 09:20:33,307 INFO L204 MainTranslator]: Completed translation [2024-09-13 09:20:33,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33 WrapperNode [2024-09-13 09:20:33,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 09:20:33,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 09:20:33,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 09:20:33,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 09:20:33,315 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:20:33" (1/1) ... [2024-09-13 09:20:33,321 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:20:33" (1/1) ... [2024-09-13 09:20:33,326 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 09:20:33,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 09:20:33,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 09:20:33,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 09:20:33,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 09:20:33,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,352 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:20:33,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 09:20:33,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 09:20:33,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 09:20:33,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 09:20:33,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (1/1) ... [2024-09-13 09:20:33,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 09:20:33,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:20:33,400 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:20:33,403 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:20:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 09:20:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 09:20:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 09:20:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 09:20:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 09:20:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 09:20:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 09:20:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 09:20:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 09:20:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 09:20:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 09:20:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 09:20:33,489 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 09:20:33,491 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 09:20:33,613 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-13 09:20:33,614 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 09:20:33,631 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 09:20:33,631 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 09:20:33,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:20:33 BoogieIcfgContainer [2024-09-13 09:20:33,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 09:20:33,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 09:20:33,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 09:20:33,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 09:20:33,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 09:20:33" (1/3) ... [2024-09-13 09:20:33,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2b8969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 09:20:33, skipping insertion in model container [2024-09-13 09:20:33,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:20:33" (2/3) ... [2024-09-13 09:20:33,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2b8969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 09:20:33, skipping insertion in model container [2024-09-13 09:20:33,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:20:33" (3/3) ... [2024-09-13 09:20:33,639 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound2.c [2024-09-13 09:20:33,652 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 09:20:33,652 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 09:20:33,692 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 09:20:33,698 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;@45419a78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 09:20:33,698 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 09:20:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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:20:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 09:20:33,706 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:20:33,707 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:20:33,707 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:20:33,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1666515900, now seen corresponding path program 1 times [2024-09-13 09:20:33,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:20:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597582520] [2024-09-13 09:20:33,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:20:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:20:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:33,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:20:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:33,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:20:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:33,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 09:20:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:20:33,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:20:33,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597582520] [2024-09-13 09:20:33,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597582520] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:20:33,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:20:33,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 09:20:33,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168195635] [2024-09-13 09:20:33,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:20:33,887 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 09:20:33,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:20:33,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 09:20:33,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 09:20:33,909 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 09:20:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:20:33,991 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-13 09:20:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 09:20:33,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-13 09:20:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:20:34,000 INFO L225 Difference]: With dead ends: 51 [2024-09-13 09:20:34,001 INFO L226 Difference]: Without dead ends: 25 [2024-09-13 09:20:34,003 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 09:20:34,007 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:20:34,009 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:20:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-13 09:20:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-09-13 09:20:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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:20:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-09-13 09:20:34,045 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2024-09-13 09:20:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:20:34,045 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-09-13 09:20:34,046 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 09:20:34,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-09-13 09:20:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 09:20:34,050 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:20:34,050 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:20:34,050 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 09:20:34,050 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:20:34,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:34,051 INFO L85 PathProgramCache]: Analyzing trace with hash -387848543, now seen corresponding path program 1 times [2024-09-13 09:20:34,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:20:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249283152] [2024-09-13 09:20:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:20:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:20:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:20:34,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218270900] [2024-09-13 09:20:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:20:34,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:20:34,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:20:34,095 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:20:34,097 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:20:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:34,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-13 09:20:34,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:20:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:20:34,259 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 09:20:34,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:20:34,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249283152] [2024-09-13 09:20:34,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:20:34,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218270900] [2024-09-13 09:20:34,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218270900] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:20:34,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:20:34,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:20:34,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604982184] [2024-09-13 09:20:34,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:20:34,264 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:20:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:20:34,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:20:34,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:20:34,266 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 09:20:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:20:34,300 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-09-13 09:20:34,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:20:34,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-09-13 09:20:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:20:34,302 INFO L225 Difference]: With dead ends: 35 [2024-09-13 09:20:34,302 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 09:20:34,302 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:20:34,303 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:20:34,305 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:20:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 09:20:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-13 09:20:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 09:20:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-13 09:20:34,312 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2024-09-13 09:20:34,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:20:34,313 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-13 09:20:34,314 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 09:20:34,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-13 09:20:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 09:20:34,315 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:20:34,315 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:20:34,329 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 09:20:34,519 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:20:34,520 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:20:34,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 783720481, now seen corresponding path program 1 times [2024-09-13 09:20:34,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:20:34,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260177806] [2024-09-13 09:20:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:20:34,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:20:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:34,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:20:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:34,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:20:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:34,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 09:20:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:20:34,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:20:34,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260177806] [2024-09-13 09:20:34,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260177806] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:20:34,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:20:34,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:20:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992175033] [2024-09-13 09:20:34,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:20:34,664 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:20:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:20:34,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:20:34,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:20:34,665 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 09:20:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:20:34,721 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-09-13 09:20:34,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 09:20:34,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-13 09:20:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:20:34,724 INFO L225 Difference]: With dead ends: 39 [2024-09-13 09:20:34,724 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 09:20:34,724 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:20:34,725 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:20:34,725 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:20:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 09:20:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-13 09:20:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 09:20:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-09-13 09:20:34,739 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2024-09-13 09:20:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:20:34,739 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-09-13 09:20:34,739 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 09:20:34,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-09-13 09:20:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 09:20:34,741 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:20:34,742 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:20:34,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 09:20:34,742 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:20:34,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:34,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1293449266, now seen corresponding path program 1 times [2024-09-13 09:20:34,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:20:34,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378341460] [2024-09-13 09:20:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:20:34,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:20:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:34,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:20:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:34,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:20:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:34,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 09:20:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:34,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 09:20:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:20:35,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:20:35,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378341460] [2024-09-13 09:20:35,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378341460] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 09:20:35,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224910039] [2024-09-13 09:20:35,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:20:35,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:20:35,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:20:35,027 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:20:35,028 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:20:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:35,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-13 09:20:35,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:20:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:20:35,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:20:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:20:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224910039] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:20:35,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 09:20:35,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2024-09-13 09:20:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999636669] [2024-09-13 09:20:35,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 09:20:35,367 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 09:20:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:20:35,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 09:20:35,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-09-13 09:20:35,369 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 09:20:39,691 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 [] [2024-09-13 09:20:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:20:39,742 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-09-13 09:20:39,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 09:20:39,743 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 29 [2024-09-13 09:20:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:20:39,744 INFO L225 Difference]: With dead ends: 45 [2024-09-13 09:20:39,744 INFO L226 Difference]: Without dead ends: 39 [2024-09-13 09:20:39,744 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-09-13 09:20:39,745 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-09-13 09:20:39,747 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 101 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-09-13 09:20:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-13 09:20:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-13 09:20:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 09:20:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-09-13 09:20:39,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2024-09-13 09:20:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:20:39,759 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-09-13 09:20:39,760 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 09:20:39,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-09-13 09:20:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-13 09:20:39,762 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:20:39,763 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:20:39,777 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:20:39,963 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 09:20:39,964 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:20:39,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:39,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1959775791, now seen corresponding path program 1 times [2024-09-13 09:20:39,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:20:39,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595502267] [2024-09-13 09:20:39,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:20:39,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:20:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:40,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:20:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:40,091 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:20:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:40,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 09:20:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:40,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 09:20:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:40,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-13 09:20:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 09:20:40,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:20:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595502267] [2024-09-13 09:20:40,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595502267] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 09:20:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639766329] [2024-09-13 09:20:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:20:40,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:20:40,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:20:40,117 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:20:40,117 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:20:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:40,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 09:20:40,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:20:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:20:40,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:20:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 09:20:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639766329] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:20:40,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 09:20:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 9 [2024-09-13 09:20:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093263781] [2024-09-13 09:20:40,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 09:20:40,276 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 09:20:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:20:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 09:20:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-13 09:20:40,277 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-13 09:20:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:20:40,383 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2024-09-13 09:20:40,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 09:20:40,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 38 [2024-09-13 09:20:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:20:40,385 INFO L225 Difference]: With dead ends: 50 [2024-09-13 09:20:40,385 INFO L226 Difference]: Without dead ends: 36 [2024-09-13 09:20:40,385 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-09-13 09:20:40,386 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:20:40,386 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 47 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:20:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-13 09:20:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-09-13 09:20:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 7 states have call successors, (7), 6 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:20:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-09-13 09:20:40,393 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 38 [2024-09-13 09:20:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:20:40,393 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2024-09-13 09:20:40,393 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-13 09:20:40,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-09-13 09:20:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 09:20:40,394 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:20:40,394 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:20:40,407 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 09:20:40,595 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 09:20:40,595 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:20:40,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash -701383951, now seen corresponding path program 1 times [2024-09-13 09:20:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:20:40,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640280233] [2024-09-13 09:20:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:20:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:20:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:20:40,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640752115] [2024-09-13 09:20:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:20:40,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:20:40,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:20:40,635 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:20:40,637 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:20:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:20:40,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-13 09:20:40,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:20:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 09:20:40,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:20:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 8 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 09:20:53,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:20:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640280233] [2024-09-13 09:20:53,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:20:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640752115] [2024-09-13 09:20:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640752115] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:20:53,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 09:20:53,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-09-13 09:20:53,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506336545] [2024-09-13 09:20:53,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 09:20:53,515 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-13 09:20:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:20:53,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-13 09:20:53,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=223, Unknown=3, NotChecked=0, Total=272 [2024-09-13 09:20:53,516 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 17 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-13 09:20:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:20:53,692 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2024-09-13 09:20:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 09:20:53,692 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 39 [2024-09-13 09:20:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:20:53,693 INFO L225 Difference]: With dead ends: 36 [2024-09-13 09:20:53,693 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 09:20:53,693 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=52, Invalid=251, Unknown=3, NotChecked=0, Total=306 [2024-09-13 09:20:53,694 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 09:20:53,694 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 184 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 09:20:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 09:20:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 09:20:53,695 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:20:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 09:20:53,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-09-13 09:20:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:20:53,695 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 09:20:53,696 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-13 09:20:53,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:20:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 09:20:53,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 09:20:53,698 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 09:20:53,711 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 09:20:53,899 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 09:20:53,901 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-13 09:20:53,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 09:20:54,698 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 09:20:54,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 09:20:54 BoogieIcfgContainer [2024-09-13 09:20:54,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 09:20:54,718 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 09:20:54,718 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 09:20:54,718 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 09:20:54,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:20:33" (3/4) ... [2024-09-13 09:20:54,720 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 09:20:54,722 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 09:20:54,722 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-13 09:20:54,722 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 09:20:54,722 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-13 09:20:54,724 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-09-13 09:20:54,725 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-13 09:20:54,725 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-13 09:20:54,725 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 09:20:54,742 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 <= counter) && (1 <= z)) && (((long long) z * z) == y)) && (x == ((long long) z + 1))) || ((((2 <= counter) && (y == ((__int128) ((long long) z * z) * z))) && (1 <= z)) && (x == ((((long long) z * z) + z) + 1)))) || ((((z == y) && (x == 1)) && (counter == 0)) && (1 <= z))) && (\old(counter) == 0)) [2024-09-13 09:20:54,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 09:20:54,791 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 09:20:54,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 09:20:54,791 INFO L158 Benchmark]: Toolchain (without parser) took 21679.51ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 127.3MB in the beginning and 223.1MB in the end (delta: -95.8MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2024-09-13 09:20:54,791 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 09:20:54,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.50ms. Allocated memory is still 184.5MB. Free memory was 127.0MB in the beginning and 115.7MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 09:20:54,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.58ms. Allocated memory is still 184.5MB. Free memory was 115.3MB in the beginning and 114.6MB in the end (delta: 742.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 09:20:54,792 INFO L158 Benchmark]: Boogie Preprocessor took 41.94ms. Allocated memory is still 184.5MB. Free memory was 114.6MB in the beginning and 112.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 09:20:54,792 INFO L158 Benchmark]: RCFGBuilder took 262.24ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 99.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 09:20:54,792 INFO L158 Benchmark]: TraceAbstraction took 21083.42ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 99.0MB in the beginning and 77.2MB in the end (delta: 21.8MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2024-09-13 09:20:54,793 INFO L158 Benchmark]: Witness Printer took 73.26ms. Allocated memory is still 255.9MB. Free memory was 77.2MB in the beginning and 223.1MB in the end (delta: -145.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 09:20:54,794 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.14ms. Allocated memory is still 184.5MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.50ms. Allocated memory is still 184.5MB. Free memory was 127.0MB in the beginning and 115.7MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.58ms. Allocated memory is still 184.5MB. Free memory was 115.3MB in the beginning and 114.6MB in the end (delta: 742.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.94ms. Allocated memory is still 184.5MB. Free memory was 114.6MB in the beginning and 112.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 262.24ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 99.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21083.42ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 99.0MB in the beginning and 77.2MB in the end (delta: 21.8MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. * Witness Printer took 73.26ms. Allocated memory is still 255.9MB. Free memory was 77.2MB in the beginning and 223.1MB in the end (delta: -145.9MB). 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: 18]: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 476 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 97 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 240 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=4, InterpolantAutomatonStates: 48, 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, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 335 ConstructedInterpolants, 1 QuantifiedInterpolants, 1120 SizeOfPredicates, 7 NumberOfNonLiveVariables, 402 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 108/136 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: 35]: Loop Invariant Derived loop invariant: (((((((1 <= counter) && (1 <= z)) && (((long long) z * z) == y)) && (x == ((long long) z + 1))) || ((((2 <= counter) && (y == ((__int128) ((long long) z * z) * z))) && (1 <= z)) && (x == ((((long long) z * z) + z) + 1)))) || ((((z == y) && (x == 1)) && (counter == 0)) && (1 <= z))) && (\old(counter) == 0)) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((\old(cond) != 0) && (counter == 0)) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) == 1) Ensures: (\old(cond) == 1) RESULT: Ultimate proved your program to be correct! [2024-09-13 09:20:54,812 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