./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sum_by_3_abstracted.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d 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/loops-crafted-1/sum_by_3_abstracted.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 83faa6e73eecf1794606bf7d9aa443e43ed9860cb538a0ff2fa0adbaa1b8efd0 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 12:13:04,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:13:04,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:13:04,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:13:04,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:13:04,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:13:04,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:13:04,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:13:04,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:13:04,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:13:04,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:13:04,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:13:04,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:13:04,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:13:04,212 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:13:04,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:13:04,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:13:04,213 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:13:04,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:13:04,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:13:04,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:13:04,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:13:04,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:13:04,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:13:04,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:13:04,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:13:04,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:13:04,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:13:04,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:13:04,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:13:04,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:13:04,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:13:04,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:13:04,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:13:04,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:13:04,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:13:04,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:13:04,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:13:04,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:13:04,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:13:04,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:13:04,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:13:04,224 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 -> 83faa6e73eecf1794606bf7d9aa443e43ed9860cb538a0ff2fa0adbaa1b8efd0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 12:13:04,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:13:04,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:13:04,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:13:04,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:13:04,580 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:13:04,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/sum_by_3_abstracted.c [2024-09-20 12:13:05,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:13:06,164 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:13:06,165 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/sum_by_3_abstracted.c [2024-09-20 12:13:06,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a87529c87/55a0916acafc4832bedd1b89d06b6f67/FLAG90f2e987b [2024-09-20 12:13:06,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a87529c87/55a0916acafc4832bedd1b89d06b6f67 [2024-09-20 12:13:06,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:13:06,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:13:06,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:13:06,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:13:06,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:13:06,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2c3531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06, skipping insertion in model container [2024-09-20 12:13:06,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:13:06,383 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/sum_by_3_abstracted.c[824,837] [2024-09-20 12:13:06,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:13:06,407 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:13:06,420 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/sum_by_3_abstracted.c[824,837] [2024-09-20 12:13:06,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:13:06,440 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:13:06,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06 WrapperNode [2024-09-20 12:13:06,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:13:06,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:13:06,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:13:06,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:13:06,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,471 INFO L138 Inliner]: procedures = 21, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:13:06,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:13:06,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:13:06,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:13:06,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:13:06,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,507 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-20 12:13:06,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:13:06,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:13:06,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:13:06,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:13:06,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (1/1) ... [2024-09-20 12:13:06,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:13:06,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:13:06,565 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-20 12:13:06,569 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-20 12:13:06,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:13:06,613 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:13:06,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:13:06,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:13:06,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:13:06,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:13:06,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:13:06,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:13:06,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:13:06,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:13:06,669 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:13:06,671 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:13:06,848 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-20 12:13:06,849 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:13:06,868 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:13:06,868 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 12:13:06,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:13:06 BoogieIcfgContainer [2024-09-20 12:13:06,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:13:06,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:13:06,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:13:06,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:13:06,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:13:06" (1/3) ... [2024-09-20 12:13:06,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64abc495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:13:06, skipping insertion in model container [2024-09-20 12:13:06,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:13:06" (2/3) ... [2024-09-20 12:13:06,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64abc495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:13:06, skipping insertion in model container [2024-09-20 12:13:06,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:13:06" (3/3) ... [2024-09-20 12:13:06,875 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_by_3_abstracted.c [2024-09-20 12:13:06,889 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:13:06,889 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:13:06,939 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:13:06,945 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;@27b9d089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:13:06,945 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:13:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 12:13:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-20 12:13:06,956 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:06,956 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:13:06,957 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:06,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:06,962 INFO L85 PathProgramCache]: Analyzing trace with hash 958432629, now seen corresponding path program 1 times [2024-09-20 12:13:06,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:06,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327655411] [2024-09-20 12:13:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:06,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:08,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:08,032 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-20 12:13:08,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:08,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327655411] [2024-09-20 12:13:08,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327655411] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:08,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:13:08,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 12:13:08,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963857364] [2024-09-20 12:13:08,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:08,040 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 12:13:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:08,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 12:13:08,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:13:08,068 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:08,444 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2024-09-20 12:13:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 12:13:08,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-20 12:13:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:08,459 INFO L225 Difference]: With dead ends: 68 [2024-09-20 12:13:08,459 INFO L226 Difference]: Without dead ends: 29 [2024-09-20 12:13:08,463 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-09-20 12:13:08,467 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 98 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:08,469 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 20 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 12:13:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-20 12:13:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2024-09-20 12:13:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-20 12:13:08,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2024-09-20 12:13:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:08,507 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-20 12:13:08,507 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:08,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-20 12:13:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 12:13:08,509 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:08,509 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:13:08,509 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:13:08,509 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:08,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash -317821787, now seen corresponding path program 1 times [2024-09-20 12:13:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:08,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558346357] [2024-09-20 12:13:08,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:08,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:13:08,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:08,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558346357] [2024-09-20 12:13:08,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558346357] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:08,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:13:08,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 12:13:08,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138438310] [2024-09-20 12:13:08,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:08,601 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 12:13:08,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:08,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 12:13:08,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-20 12:13:08,603 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:08,688 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-09-20 12:13:08,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:13:08,689 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-20 12:13:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:08,690 INFO L225 Difference]: With dead ends: 31 [2024-09-20 12:13:08,690 INFO L226 Difference]: Without dead ends: 19 [2024-09-20 12:13:08,691 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:13:08,692 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:08,692 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:13:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-20 12:13:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-20 12:13:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-09-20 12:13:08,702 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2024-09-20 12:13:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:08,702 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-09-20 12:13:08,702 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:08,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-09-20 12:13:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-20 12:13:08,705 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:08,705 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:13:08,705 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:13:08,705 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:08,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash 287172186, now seen corresponding path program 1 times [2024-09-20 12:13:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:08,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665971738] [2024-09-20 12:13:08,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:08,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:09,586 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:09,597 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-20 12:13:09,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:09,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665971738] [2024-09-20 12:13:09,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665971738] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:09,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:13:09,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 12:13:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268078150] [2024-09-20 12:13:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:09,599 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 12:13:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 12:13:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-09-20 12:13:09,601 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:10,251 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-09-20 12:13:10,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-20 12:13:10,252 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-20 12:13:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:10,253 INFO L225 Difference]: With dead ends: 35 [2024-09-20 12:13:10,253 INFO L226 Difference]: Without dead ends: 30 [2024-09-20 12:13:10,253 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2024-09-20 12:13:10,254 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 89 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:10,255 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 16 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 12:13:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-20 12:13:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2024-09-20 12:13:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-09-20 12:13:10,270 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2024-09-20 12:13:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:10,271 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-09-20 12:13:10,271 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:10,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-09-20 12:13:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-20 12:13:10,273 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:10,273 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:13:10,273 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 12:13:10,273 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:10,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash -105854824, now seen corresponding path program 1 times [2024-09-20 12:13:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:10,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38418777] [2024-09-20 12:13:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:10,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:10,307 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-20 12:13:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38418777] [2024-09-20 12:13:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38418777] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:10,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:13:10,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-20 12:13:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955547600] [2024-09-20 12:13:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:10,309 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 12:13:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 12:13:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 12:13:10,310 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:10,363 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-09-20 12:13:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 12:13:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-20 12:13:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:10,364 INFO L225 Difference]: With dead ends: 32 [2024-09-20 12:13:10,364 INFO L226 Difference]: Without dead ends: 22 [2024-09-20 12:13:10,365 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-20 12:13:10,366 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:10,366 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:13:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-20 12:13:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-20 12:13:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-20 12:13:10,376 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2024-09-20 12:13:10,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:10,376 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-20 12:13:10,376 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:10,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-20 12:13:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-20 12:13:10,377 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:10,377 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:13:10,378 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 12:13:10,378 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:10,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:10,378 INFO L85 PathProgramCache]: Analyzing trace with hash 347940960, now seen corresponding path program 1 times [2024-09-20 12:13:10,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:10,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438856653] [2024-09-20 12:13:10,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:10,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:11,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:13:11,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438856653] [2024-09-20 12:13:11,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438856653] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:13:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161831664] [2024-09-20 12:13:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:11,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:13:11,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:13:11,584 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-20 12:13:11,586 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-20 12:13:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:11,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:13:11,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:13:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:13:11,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:13:11,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161831664] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:11,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 12:13:11,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2024-09-20 12:13:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444677114] [2024-09-20 12:13:11,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:11,714 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 12:13:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 12:13:11,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-09-20 12:13:11,717 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:11,768 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-09-20 12:13:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 12:13:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-20 12:13:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:11,771 INFO L225 Difference]: With dead ends: 28 [2024-09-20 12:13:11,771 INFO L226 Difference]: Without dead ends: 20 [2024-09-20 12:13:11,771 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-09-20 12:13:11,774 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:11,775 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:13:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-20 12:13:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-09-20 12:13:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-09-20 12:13:11,789 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2024-09-20 12:13:11,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:11,790 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-09-20 12:13:11,791 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:11,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-09-20 12:13:11,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-20 12:13:11,792 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:11,792 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:13:11,809 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 12:13:11,992 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:13:11,993 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:11,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1749122815, now seen corresponding path program 1 times [2024-09-20 12:13:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:11,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725637258] [2024-09-20 12:13:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:12,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:13:12,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:12,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725637258] [2024-09-20 12:13:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725637258] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:12,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:13:12,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 12:13:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166194395] [2024-09-20 12:13:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:12,301 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 12:13:12,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:12,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 12:13:12,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-20 12:13:12,303 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:12,441 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-09-20 12:13:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 12:13:12,442 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-20 12:13:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:12,442 INFO L225 Difference]: With dead ends: 20 [2024-09-20 12:13:12,442 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 12:13:12,442 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-09-20 12:13:12,445 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:12,446 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 15 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:13:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 12:13:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 12:13:12,446 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-20 12:13:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 12:13:12,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-09-20 12:13:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:12,447 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 12:13:12,447 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:13:12,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 12:13:12,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 12:13:12,450 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 12:13:12,451 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 12:13:12,453 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-20 12:13:12,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 12:13:12,883 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 12:13:12,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:13:12 BoogieIcfgContainer [2024-09-20 12:13:12,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 12:13:12,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 12:13:12,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 12:13:12,910 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 12:13:12,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:13:06" (3/4) ... [2024-09-20 12:13:12,913 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 12:13:12,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 12:13:12,972 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 12:13:12,972 INFO L158 Benchmark]: Toolchain (without parser) took 6784.05ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 164.8MB in the beginning and 190.3MB in the end (delta: -25.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-09-20 12:13:12,972 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:13:12,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.86ms. Allocated memory is still 205.5MB. Free memory was 164.8MB in the beginning and 152.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 12:13:12,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.30ms. Allocated memory is still 205.5MB. Free memory was 152.2MB in the beginning and 151.7MB in the end (delta: 503.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:13:12,973 INFO L158 Benchmark]: Boogie Preprocessor took 53.11ms. Allocated memory is still 205.5MB. Free memory was 151.7MB in the beginning and 150.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:13:12,973 INFO L158 Benchmark]: RCFGBuilder took 342.41ms. Allocated memory is still 205.5MB. Free memory was 150.0MB in the beginning and 168.6MB in the end (delta: -18.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 12:13:12,974 INFO L158 Benchmark]: TraceAbstraction took 6038.74ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 167.8MB in the beginning and 192.4MB in the end (delta: -24.6MB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. [2024-09-20 12:13:12,974 INFO L158 Benchmark]: Witness Printer took 61.97ms. Allocated memory is still 247.5MB. Free memory was 192.4MB in the beginning and 190.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:13:12,976 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.11ms. Allocated memory is still 104.9MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.86ms. Allocated memory is still 205.5MB. Free memory was 164.8MB in the beginning and 152.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.30ms. Allocated memory is still 205.5MB. Free memory was 152.2MB in the beginning and 151.7MB in the end (delta: 503.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.11ms. Allocated memory is still 205.5MB. Free memory was 151.7MB in the beginning and 150.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 342.41ms. Allocated memory is still 205.5MB. Free memory was 150.0MB in the beginning and 168.6MB in the end (delta: -18.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6038.74ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 167.8MB in the beginning and 192.4MB in the end (delta: -24.6MB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. * Witness Printer took 61.97ms. Allocated memory is still 247.5MB. Free memory was 192.4MB in the beginning and 190.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: 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 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 592 IncrementalHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 32 mSDtfsCounter, 592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 52, 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, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 1381 SizeOfPredicates, 1 NumberOfNonLiveVariables, 60 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 3/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((k == 0) && (n <= 0)) && (j == 0)) && (i == 0)) || (((((((((unsigned long long) i * 4294967293) + 60000003) % 4294967296) <= 60000000) && (k == j)) && (i == j)) && (i <= 20000001)) && (n <= ((unsigned) j % 4294967296)))) && (SIZE == 20000001)) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: (((((n <= 0) && (j == 0)) && (i == 0)) || ((((((((unsigned long long) i * 4294967293) + 60000003) % 4294967296) <= 60000000) && (n <= i)) && (i == j)) && (i <= 20000001))) && (SIZE == 20000001)) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main. Requires: (SIZE == 20000001) Ensures: (SIZE == 20000001) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: ((\old(cond) != 0) && (SIZE == 20000001)) Ensures: ((\old(cond) != 0) && (SIZE == 20000001)) RESULT: Ultimate proved your program to be correct! [2024-09-20 12:13:13,007 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