./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sum_by_3.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.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 cbdeb806056afbf44cc985ff91f53f00e848d18cfefb92d1f6744eb19cf6d91b --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:12:57,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:12:57,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:12:57,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:12:57,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:12:57,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:12:57,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:12:57,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:12:57,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:12:57,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:12:57,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:12:57,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:12:57,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:12:57,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:12:57,243 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:12:57,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:12:57,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:12:57,245 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:12:57,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:12:57,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:12:57,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:12:57,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:12:57,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:12:57,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:12:57,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:12:57,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:12:57,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:12:57,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:12:57,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:12:57,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:12:57,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:12:57,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:12:57,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:12:57,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:12:57,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:12:57,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:12:57,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:12:57,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:12:57,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:12:57,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:12:57,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:12:57,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:12:57,250 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 -> cbdeb806056afbf44cc985ff91f53f00e848d18cfefb92d1f6744eb19cf6d91b 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:12:57,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:12:57,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:12:57,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:12:57,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:12:57,538 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:12:57,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/sum_by_3.c [2024-09-20 12:12:58,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:12:59,105 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:12:59,105 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/sum_by_3.c [2024-09-20 12:12:59,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b7c7ed40f/c35b5c129a8743f3bfa1480e78954676/FLAG8e00e5b05 [2024-09-20 12:12:59,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b7c7ed40f/c35b5c129a8743f3bfa1480e78954676 [2024-09-20 12:12:59,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:12:59,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:12:59,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:12:59,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:12:59,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:12:59,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640e5526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59, skipping insertion in model container [2024-09-20 12:12:59,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:12:59,327 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.c[406,419] [2024-09-20 12:12:59,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:12:59,358 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:12:59,371 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.c[406,419] [2024-09-20 12:12:59,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:12:59,394 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:12:59,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59 WrapperNode [2024-09-20 12:12:59,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:12:59,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:12:59,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:12:59,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:12:59,403 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:12:59" (1/1) ... [2024-09-20 12:12:59,409 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:12:59" (1/1) ... [2024-09-20 12:12:59,416 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:12:59,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:12:59,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:12:59,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:12:59,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:12:59,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,448 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:12:59,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:12:59,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:12:59,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:12:59,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:12:59,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (1/1) ... [2024-09-20 12:12:59,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:12:59,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:12:59,498 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:12:59,502 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:12:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:12:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:12:59,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:12:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:12:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:12:59,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:12:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:12:59,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:12:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:12:59,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:12:59,607 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:12:59,612 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:12:59,794 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-20 12:12:59,794 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:12:59,824 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:12:59,824 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-20 12:12:59,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:12:59 BoogieIcfgContainer [2024-09-20 12:12:59,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:12:59,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:12:59,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:12:59,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:12:59,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:12:59" (1/3) ... [2024-09-20 12:12:59,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21eeea9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:12:59, skipping insertion in model container [2024-09-20 12:12:59,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:12:59" (2/3) ... [2024-09-20 12:12:59,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21eeea9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:12:59, skipping insertion in model container [2024-09-20 12:12:59,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:12:59" (3/3) ... [2024-09-20 12:12:59,835 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2024-09-20 12:12:59,851 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:12:59,851 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:12:59,930 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:12:59,938 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;@38cae045, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:12:59,939 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:12:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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:12:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-20 12:12:59,951 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:12:59,952 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:12:59,952 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:12:59,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:12:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash 46808937, now seen corresponding path program 1 times [2024-09-20 12:12:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:12:59,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870375521] [2024-09-20 12:12:59,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:12:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:00,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:00,132 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:00,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:00,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870375521] [2024-09-20 12:13:00,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870375521] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:00,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:13:00,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:13:00,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749742599] [2024-09-20 12:13:00,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:00,143 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:13:00,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:00,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:13:00,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:13:00,173 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:00,275 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2024-09-20 12:13:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:13:00,278 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, (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:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:00,285 INFO L225 Difference]: With dead ends: 39 [2024-09-20 12:13:00,285 INFO L226 Difference]: Without dead ends: 16 [2024-09-20 12:13:00,288 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-20 12:13:00,294 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:00,295 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 7 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:13:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-20 12:13:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-20 12:13:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-20 12:13:00,376 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 15 [2024-09-20 12:13:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:00,377 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-20 12:13:00,377 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, (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:00,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-20 12:13:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-20 12:13:00,379 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:00,379 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:00,379 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:13:00,380 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:00,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 791761509, now seen corresponding path program 1 times [2024-09-20 12:13:00,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:00,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000047913] [2024-09-20 12:13:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:00,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:01,182 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:01,198 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:01,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:01,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000047913] [2024-09-20 12:13:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000047913] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:13:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 12:13:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816508875] [2024-09-20 12:13:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:01,200 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 12:13:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:01,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 12:13:01,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:13:01,203 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. 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:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:01,411 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-09-20 12:13:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 12:13:01,412 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:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:01,414 INFO L225 Difference]: With dead ends: 32 [2024-09-20 12:13:01,415 INFO L226 Difference]: Without dead ends: 27 [2024-09-20 12:13:01,416 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 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:01,419 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 67 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:01,420 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 12 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:13:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-20 12:13:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2024-09-20 12:13:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-20 12:13:01,435 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2024-09-20 12:13:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:01,435 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-20 12:13:01,436 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:01,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-20 12:13:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 12:13:01,438 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:01,438 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:01,438 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:13:01,439 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:01,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1189659223, now seen corresponding path program 1 times [2024-09-20 12:13:01,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:01,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767777258] [2024-09-20 12:13:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:01,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:01,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:01,570 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:01,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767777258] [2024-09-20 12:13:01,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767777258] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:01,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:13:01,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 12:13:01,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159649956] [2024-09-20 12:13:01,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:01,571 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 12:13:01,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:01,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 12:13:01,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-20 12:13:01,575 INFO L87 Difference]: Start difference. First operand 21 states and 25 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:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:01,655 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-20 12:13:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:13:01,656 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:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:01,657 INFO L225 Difference]: With dead ends: 29 [2024-09-20 12:13:01,657 INFO L226 Difference]: Without dead ends: 17 [2024-09-20 12:13:01,657 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:01,658 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:01,658 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:13:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-20 12:13:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-20 12:13:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-09-20 12:13:01,668 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2024-09-20 12:13:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:01,668 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-09-20 12:13:01,668 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:01,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-09-20 12:13:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 12:13:01,671 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:01,671 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:01,671 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 12:13:01,672 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:01,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:01,675 INFO L85 PathProgramCache]: Analyzing trace with hash 69618347, now seen corresponding path program 1 times [2024-09-20 12:13:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:01,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967563534] [2024-09-20 12:13:01,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:01,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:02,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:02,915 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:02,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967563534] [2024-09-20 12:13:02,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967563534] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:13:02,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593006819] [2024-09-20 12:13:02,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:02,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:13:02,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:13:02,919 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:02,920 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:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:02,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-20 12:13:02,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:13:03,171 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:03,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:13:03,445 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:03,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593006819] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:13:03,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:13:03,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-09-20 12:13:03,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069489485] [2024-09-20 12:13:03,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:13:03,447 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-20 12:13:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:03,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-20 12:13:03,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-09-20 12:13:03,449 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 18 states have internal predecessors, (31), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 12:13:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:04,291 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2024-09-20 12:13:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-20 12:13:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 18 states have internal predecessors, (31), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-20 12:13:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:04,294 INFO L225 Difference]: With dead ends: 65 [2024-09-20 12:13:04,294 INFO L226 Difference]: Without dead ends: 56 [2024-09-20 12:13:04,295 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=442, Invalid=1450, Unknown=0, NotChecked=0, Total=1892 [2024-09-20 12:13:04,297 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 255 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:04,298 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 18 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 12:13:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-20 12:13:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 28. [2024-09-20 12:13:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-09-20 12:13:04,317 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 16 [2024-09-20 12:13:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:04,317 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-09-20 12:13:04,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 18 states have internal predecessors, (31), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 12:13:04,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-09-20 12:13:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-20 12:13:04,318 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:04,318 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:13:04,337 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-20 12:13:04,522 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:13:04,523 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:04,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash -679036501, now seen corresponding path program 1 times [2024-09-20 12:13:04,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:04,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376637451] [2024-09-20 12:13:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:04,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 12:13:04,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376637451] [2024-09-20 12:13:04,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376637451] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:13:04,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691055446] [2024-09-20 12:13:04,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:04,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:13:04,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:13:04,663 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-20 12:13:04,664 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-20 12:13:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:04,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:13:04,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:13:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 12:13:04,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:13:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691055446] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:04,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 12:13:04,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-09-20 12:13:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457239562] [2024-09-20 12:13:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:04,722 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 12:13:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 12:13:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:13:04,723 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:04,765 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-09-20 12:13:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 12:13:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2024-09-20 12:13:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:04,767 INFO L225 Difference]: With dead ends: 35 [2024-09-20 12:13:04,767 INFO L226 Difference]: Without dead ends: 24 [2024-09-20 12:13:04,767 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-20 12:13:04,768 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:04,768 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 29 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:13:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-20 12:13:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-20 12:13:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-20 12:13:04,777 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2024-09-20 12:13:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:04,778 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-20 12:13:04,778 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:04,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-20 12:13:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-20 12:13:04,779 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:04,779 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:13:04,796 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 12:13:04,980 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:13:04,980 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:04,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash 934399435, now seen corresponding path program 1 times [2024-09-20 12:13:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:04,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946361089] [2024-09-20 12:13:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:05,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 12:13:05,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946361089] [2024-09-20 12:13:05,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946361089] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:13:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651931766] [2024-09-20 12:13:05,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:05,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:13:05,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:13:05,141 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-20 12:13:05,143 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-20 12:13:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:05,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-20 12:13:05,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:13:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 12:13:05,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:13:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 12:13:05,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651931766] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 12:13:05,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 12:13:05,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 10 [2024-09-20 12:13:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867085964] [2024-09-20 12:13:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:05,266 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 12:13:05,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:05,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 12:13:05,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-09-20 12:13:05,267 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:05,325 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-20 12:13:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 12:13:05,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2024-09-20 12:13:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:05,328 INFO L225 Difference]: With dead ends: 33 [2024-09-20 12:13:05,328 INFO L226 Difference]: Without dead ends: 20 [2024-09-20 12:13:05,328 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-20 12:13:05,329 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:05,330 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 25 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:13:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-20 12:13:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-09-20 12:13:05,340 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:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-09-20 12:13:05,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2024-09-20 12:13:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:05,341 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-09-20 12:13:05,341 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:05,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-09-20 12:13:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-20 12:13:05,342 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:05,342 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:13:05,360 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 12:13:05,543 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-20 12:13:05,543 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:05,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1087386597, now seen corresponding path program 2 times [2024-09-20 12:13:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817528695] [2024-09-20 12:13:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:05,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:06,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:13:06,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817528695] [2024-09-20 12:13:06,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817528695] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:13:06,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838377386] [2024-09-20 12:13:06,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 12:13:06,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:13:06,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:13:06,153 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-20 12:13:06,154 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-20 12:13:06,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 12:13:06,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:13:06,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-20 12:13:06,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:13:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:13:06,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:13:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:13:06,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838377386] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:13:06,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:13:06,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 29 [2024-09-20 12:13:06,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761916138] [2024-09-20 12:13:06,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:13:06,974 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-20 12:13:06,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:06,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-20 12:13:06,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2024-09-20 12:13:06,975 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 26 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 12:13:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:14,070 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-09-20 12:13:14,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-20 12:13:14,071 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 26 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-20 12:13:14,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:14,071 INFO L225 Difference]: With dead ends: 40 [2024-09-20 12:13:14,072 INFO L226 Difference]: Without dead ends: 26 [2024-09-20 12:13:14,073 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=422, Invalid=1834, Unknown=0, NotChecked=0, Total=2256 [2024-09-20 12:13:14,073 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 103 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:14,073 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 21 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-20 12:13:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-20 12:13:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-20 12:13:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-09-20 12:13:14,086 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2024-09-20 12:13:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:14,086 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-09-20 12:13:14,087 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 26 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 12:13:14,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-09-20 12:13:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-20 12:13:14,088 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:13:14,088 INFO L216 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:13:14,105 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 12:13:14,288 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:13:14,288 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:13:14,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1551065563, now seen corresponding path program 3 times [2024-09-20 12:13:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:13:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314408244] [2024-09-20 12:13:14,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:13:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:13:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:15,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:13:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:13:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:13:15,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:13:15,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314408244] [2024-09-20 12:13:15,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314408244] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:13:15,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564358320] [2024-09-20 12:13:15,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 12:13:15,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:13:15,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:13:15,068 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 12:13:15,069 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-20 12:13:15,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-20 12:13:15,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:13:15,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-20 12:13:15,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:13:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-20 12:13:15,659 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:13:15,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564358320] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:13:15,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 12:13:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18] total 28 [2024-09-20 12:13:15,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364523567] [2024-09-20 12:13:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:13:15,660 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 12:13:15,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:13:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 12:13:15,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2024-09-20 12:13:15,661 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 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:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:13:15,841 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2024-09-20 12:13:15,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 12:13:15,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 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 25 [2024-09-20 12:13:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:13:15,842 INFO L225 Difference]: With dead ends: 26 [2024-09-20 12:13:15,842 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 12:13:15,843 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2024-09-20 12:13:15,846 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:13:15,846 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 17 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:13:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 12:13:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 12:13:15,847 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:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 12:13:15,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-09-20 12:13:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:13:15,847 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 12:13:15,847 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 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:15,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:13:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 12:13:15,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 12:13:15,851 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 12:13:15,864 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-20 12:13:16,052 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-20 12:13:16,055 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-09-20 12:13:16,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 12:13:19,381 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 12:13:19,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:13:19 BoogieIcfgContainer [2024-09-20 12:13:19,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 12:13:19,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 12:13:19,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 12:13:19,401 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 12:13:19,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:12:59" (3/4) ... [2024-09-20 12:13:19,404 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 12:13:19,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 12:13:19,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 12:13:19,466 INFO L158 Benchmark]: Toolchain (without parser) took 20339.67ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 122.3MB in the beginning and 189.3MB in the end (delta: -66.9MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-09-20 12:13:19,466 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:13:19,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.12ms. Allocated memory is still 176.2MB. Free memory was 122.3MB in the beginning and 110.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 12:13:19,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.41ms. Allocated memory is still 176.2MB. Free memory was 110.8MB in the beginning and 109.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:13:19,467 INFO L158 Benchmark]: Boogie Preprocessor took 48.19ms. Allocated memory is still 176.2MB. Free memory was 109.8MB in the beginning and 108.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:13:19,467 INFO L158 Benchmark]: RCFGBuilder took 359.02ms. Allocated memory is still 176.2MB. Free memory was 108.2MB in the beginning and 96.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 12:13:19,467 INFO L158 Benchmark]: TraceAbstraction took 19571.58ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 95.1MB in the beginning and 191.4MB in the end (delta: -96.3MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2024-09-20 12:13:19,467 INFO L158 Benchmark]: Witness Printer took 64.49ms. Allocated memory is still 276.8MB. Free memory was 191.4MB in the beginning and 189.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:13:19,469 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.12ms. Allocated memory is still 176.2MB. Free memory was 122.3MB in the beginning and 110.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.41ms. Allocated memory is still 176.2MB. Free memory was 110.8MB in the beginning and 109.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.19ms. Allocated memory is still 176.2MB. Free memory was 109.8MB in the beginning and 108.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.02ms. Allocated memory is still 176.2MB. Free memory was 108.2MB in the beginning and 96.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19571.58ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 95.1MB in the beginning and 191.4MB in the end (delta: -96.3MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. * Witness Printer took 64.49ms. Allocated memory is still 276.8MB. Free memory was 191.4MB in the beginning and 189.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: 10]: 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 473 mSDsluCounter, 139 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 676 IncrementalHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 47 mSDtfsCounter, 676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=4, InterpolantAutomatonStates: 86, 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, 8 MinimizatonAttempts, 34 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 238 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 2393 SizeOfPredicates, 11 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 73/164 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: 21]: Loop Invariant Derived loop invariant: ((((i == 0) && (n <= 20000001)) || (((((i + 4294967295) % 4294967296) + 1) <= n) && (n <= 20000001))) && (SIZE == 20000001)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((SIZE == 20000001) && (n <= k)) && ((((((long long) i + k) + j) % 4294967296) / 3) <= 20000001)) && (n <= ((unsigned) j % 4294967296))) && ((((((long long) j * 2) + i) % 4294967296) / 3) <= 20000001)) && (((((long long) i * 3) % 4294967296) / 3) <= 20000001)) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((n <= i) && (SIZE == 20000001)) && (n <= ((unsigned) j % 4294967296))) && ((((((long long) j * 2) + i) % 4294967296) / 3) <= 20000001)) && (((((long long) i * 3) % 4294967296) / 3) <= 20000001)) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main. Requires: (SIZE == 20000001) Ensures: (SIZE == 20000001) - ProcedureContractResult [Line: 8]: 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:19,501 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE