./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --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/loop-lit/hh2012-ex3.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb --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:03:52,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:03:52,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:03:52,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:03:52,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:03:52,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:03:52,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:03:52,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:03:52,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:03:52,365 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:03:52,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:03:52,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:03:52,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:03:52,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:03:52,368 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:03:52,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:03:52,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:03:52,372 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:03:52,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:03:52,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:03:52,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:03:52,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:03:52,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:03:52,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:03:52,374 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:03:52,374 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:03:52,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:03:52,374 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:03:52,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:03:52,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:03:52,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:03:52,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:03:52,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:03:52,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:03:52,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:03:52,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:03:52,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:03:52,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:03:52,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:03:52,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:03:52,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:03:52,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:03:52,380 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 -> 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb 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:03:52,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:03:52,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:03:52,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:03:52,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:03:52,662 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:03:52,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-20 12:03:54,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:03:54,322 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:03:54,323 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-20 12:03:54,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/13e45b7c4/cb1de9b0033e48208e261e630a421b19/FLAG58258f020 [2024-09-20 12:03:54,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/13e45b7c4/cb1de9b0033e48208e261e630a421b19 [2024-09-20 12:03:54,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:03:54,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:03:54,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:03:54,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:03:54,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:03:54,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:54,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d44cf61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54, skipping insertion in model container [2024-09-20 12:03:54,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:54,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:03:54,897 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/loop-lit/hh2012-ex3.i[799,812] [2024-09-20 12:03:54,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:03:54,930 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:03:54,939 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/loop-lit/hh2012-ex3.i[799,812] [2024-09-20 12:03:54,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:03:54,956 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:03:54,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54 WrapperNode [2024-09-20 12:03:54,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:03:54,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:03:54,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:03:54,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:03:54,964 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:03:54" (1/1) ... [2024-09-20 12:03:54,969 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:03:54" (1/1) ... [2024-09-20 12:03:54,976 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:03:54,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:03:54,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:03:54,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:03:54,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:03:54,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:54,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:54,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:54,996 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:03:54,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:54,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:54,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:55,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:55,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:55,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:55,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:03:55,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:03:55,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:03:55,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:03:55,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (1/1) ... [2024-09-20 12:03:55,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:03:55,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:03:55,050 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:03:55,056 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:03:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:03:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:03:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:03:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:03:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:03:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:03:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:03:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:03:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:03:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:03:55,174 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:03:55,177 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:03:55,338 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-20 12:03:55,338 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:03:55,371 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:03:55,371 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 12:03:55,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:03:55 BoogieIcfgContainer [2024-09-20 12:03:55,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:03:55,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:03:55,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:03:55,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:03:55,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:03:54" (1/3) ... [2024-09-20 12:03:55,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b02288a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:03:55, skipping insertion in model container [2024-09-20 12:03:55,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:54" (2/3) ... [2024-09-20 12:03:55,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b02288a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:03:55, skipping insertion in model container [2024-09-20 12:03:55,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:03:55" (3/3) ... [2024-09-20 12:03:55,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-09-20 12:03:55,402 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:03:55,402 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:03:55,451 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:03:55,457 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;@3908164d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:03:55,458 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:03:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-20 12:03:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 12:03:55,474 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:55,475 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:55,475 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:55,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:55,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1205805759, now seen corresponding path program 1 times [2024-09-20 12:03:55,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:55,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183641731] [2024-09-20 12:03:55,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:55,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:55,750 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:03:55,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:55,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183641731] [2024-09-20 12:03:55,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183641731] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:55,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:55,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:03:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256182261] [2024-09-20 12:03:55,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:55,762 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:03:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:55,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:03:55,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:03:55,792 INFO L87 Difference]: Start difference. First operand has 26 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:03:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:55,844 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2024-09-20 12:03:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:03:55,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2024-09-20 12:03:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:55,858 INFO L225 Difference]: With dead ends: 48 [2024-09-20 12:03:55,859 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 12:03:55,864 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:03:55,869 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:55,871 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 12:03:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-20 12:03:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 12:03:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-09-20 12:03:55,942 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 11 [2024-09-20 12:03:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:55,942 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-09-20 12:03:55,943 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:03:55,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-09-20 12:03:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 12:03:55,946 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:55,946 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:55,947 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:03:55,947 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:55,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1204197045, now seen corresponding path program 1 times [2024-09-20 12:03:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:55,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044785817] [2024-09-20 12:03:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:55,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:56,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:56,139 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:03:56,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:56,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044785817] [2024-09-20 12:03:56,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044785817] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:56,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:56,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:03:56,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852062401] [2024-09-20 12:03:56,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:56,144 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:03:56,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:56,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:03:56,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:03:56,145 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:03:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:56,246 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-09-20 12:03:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:03:56,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2024-09-20 12:03:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:56,248 INFO L225 Difference]: With dead ends: 29 [2024-09-20 12:03:56,248 INFO L226 Difference]: Without dead ends: 27 [2024-09-20 12:03:56,248 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:03:56,250 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:56,251 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 88 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:03:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-20 12:03:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-20 12:03:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 12:03:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-09-20 12:03:56,266 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2024-09-20 12:03:56,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:56,267 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-09-20 12:03:56,267 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:03:56,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-09-20 12:03:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 12:03:56,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:56,269 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:56,269 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:03:56,270 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:56,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1149323679, now seen corresponding path program 1 times [2024-09-20 12:03:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229263066] [2024-09-20 12:03:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:56,502 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:56,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:03:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229263066] [2024-09-20 12:03:56,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229263066] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:56,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:56,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 12:03:56,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609487161] [2024-09-20 12:03:56,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:56,533 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 12:03:56,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:56,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 12:03:56,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:03:56,535 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-20 12:03:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:56,667 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2024-09-20 12:03:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 12:03:56,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-09-20 12:03:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:56,670 INFO L225 Difference]: With dead ends: 45 [2024-09-20 12:03:56,670 INFO L226 Difference]: Without dead ends: 43 [2024-09-20 12:03:56,670 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-20 12:03:56,672 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:56,675 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:03:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-20 12:03:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-09-20 12:03:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-20 12:03:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-09-20 12:03:56,696 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 16 [2024-09-20 12:03:56,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:56,696 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-09-20 12:03:56,696 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-20 12:03:56,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-09-20 12:03:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-20 12:03:56,699 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:56,699 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:56,699 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 12:03:56,700 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:56,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash 429495691, now seen corresponding path program 1 times [2024-09-20 12:03:56,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:56,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858090449] [2024-09-20 12:03:56,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:56,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:56,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:56,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:56,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 12:03:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:03:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858090449] [2024-09-20 12:03:56,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858090449] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:56,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:56,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 12:03:56,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695955218] [2024-09-20 12:03:56,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:56,867 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 12:03:56,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:56,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 12:03:56,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:03:56,869 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 12:03:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:56,963 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-09-20 12:03:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 12:03:56,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-20 12:03:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:56,965 INFO L225 Difference]: With dead ends: 49 [2024-09-20 12:03:56,965 INFO L226 Difference]: Without dead ends: 47 [2024-09-20 12:03:56,965 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-20 12:03:56,966 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:56,967 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:03:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-20 12:03:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-09-20 12:03:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-20 12:03:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-09-20 12:03:56,982 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 21 [2024-09-20 12:03:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:56,983 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-09-20 12:03:56,983 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 12:03:56,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-09-20 12:03:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-20 12:03:56,984 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:56,985 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:56,985 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 12:03:56,986 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:56,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1103951071, now seen corresponding path program 1 times [2024-09-20 12:03:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:56,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484273644] [2024-09-20 12:03:56,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:56,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 12:03:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 12:03:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 12:03:57,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:57,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484273644] [2024-09-20 12:03:57,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484273644] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:57,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:03:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416899682] [2024-09-20 12:03:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:57,089 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:03:57,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:03:57,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:03:57,090 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 12:03:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:57,149 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2024-09-20 12:03:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:03:57,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-09-20 12:03:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:57,154 INFO L225 Difference]: With dead ends: 92 [2024-09-20 12:03:57,154 INFO L226 Difference]: Without dead ends: 59 [2024-09-20 12:03:57,155 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:03:57,157 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:57,158 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-20 12:03:57,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-20 12:03:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-20 12:03:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-09-20 12:03:57,175 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 26 [2024-09-20 12:03:57,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:57,175 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-09-20 12:03:57,175 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 12:03:57,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-09-20 12:03:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-20 12:03:57,177 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:57,178 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:57,178 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 12:03:57,178 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:57,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1044941344, now seen corresponding path program 1 times [2024-09-20 12:03:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:57,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730387579] [2024-09-20 12:03:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,270 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 12:03:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 12:03:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 12:03:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 12:03:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 12:03:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 12:03:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-09-20 12:03:57,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:57,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730387579] [2024-09-20 12:03:57,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730387579] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:57,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:57,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 12:03:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865076956] [2024-09-20 12:03:57,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:57,313 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 12:03:57,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 12:03:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 12:03:57,315 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-20 12:03:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:57,373 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2024-09-20 12:03:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:03:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 47 [2024-09-20 12:03:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:57,376 INFO L225 Difference]: With dead ends: 65 [2024-09-20 12:03:57,378 INFO L226 Difference]: Without dead ends: 63 [2024-09-20 12:03:57,379 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:03:57,380 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:57,380 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 80 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-20 12:03:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-20 12:03:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-20 12:03:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-09-20 12:03:57,403 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 47 [2024-09-20 12:03:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:57,404 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-09-20 12:03:57,404 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-20 12:03:57,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-09-20 12:03:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-20 12:03:57,408 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:57,409 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:57,409 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 12:03:57,409 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:57,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:57,410 INFO L85 PathProgramCache]: Analyzing trace with hash 733242377, now seen corresponding path program 1 times [2024-09-20 12:03:57,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:57,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874261887] [2024-09-20 12:03:57,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:57,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 12:03:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 12:03:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 12:03:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 12:03:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 12:03:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 12:03:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 12:03:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 12:03:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 12:03:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 12:03:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 12:03:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-20 12:03:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-20 12:03:57,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:57,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874261887] [2024-09-20 12:03:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874261887] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:03:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899684323] [2024-09-20 12:03:57,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:57,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:03:57,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:03:57,566 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:03:57,568 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:03:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:57,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:03:57,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:03:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 184 proven. 7 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-09-20 12:03:57,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:03:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-20 12:03:57,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899684323] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:03:57,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:03:57,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-09-20 12:03:57,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036885352] [2024-09-20 12:03:57,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:03:57,935 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 12:03:57,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:57,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 12:03:57,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:03:57,936 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2024-09-20 12:03:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:57,986 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2024-09-20 12:03:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:03:57,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) Word has length 81 [2024-09-20 12:03:57,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:57,989 INFO L225 Difference]: With dead ends: 129 [2024-09-20 12:03:57,989 INFO L226 Difference]: Without dead ends: 83 [2024-09-20 12:03:57,989 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:03:57,990 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:57,991 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-20 12:03:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-09-20 12:03:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 41 states have call successors, (41), 8 states have call predecessors, (41), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-20 12:03:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions. [2024-09-20 12:03:58,007 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 81 [2024-09-20 12:03:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:58,008 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 118 transitions. [2024-09-20 12:03:58,008 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2024-09-20 12:03:58,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2024-09-20 12:03:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-09-20 12:03:58,010 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:58,013 INFO L216 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:58,032 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:03:58,217 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-20 12:03:58,218 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:58,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:58,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1779798679, now seen corresponding path program 2 times [2024-09-20 12:03:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102995791] [2024-09-20 12:03:58,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:58,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 12:03:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 12:03:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 12:03:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 12:03:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 12:03:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 12:03:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,546 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 12:03:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 12:03:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 12:03:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 12:03:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,573 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 12:03:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-20 12:03:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-20 12:03:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-20 12:03:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-20 12:03:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-20 12:03:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-20 12:03:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-20 12:03:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-20 12:03:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-09-20 12:03:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2024-09-20 12:03:58,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102995791] [2024-09-20 12:03:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102995791] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:03:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880837622] [2024-09-20 12:03:58,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 12:03:58,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:03:58,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:03:58,613 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:03:58,615 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:03:58,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 12:03:58,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:03:58,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-20 12:03:58,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:03:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 49 proven. 41 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-09-20 12:03:59,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:03:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2024-09-20 12:03:59,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880837622] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 12:03:59,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 12:03:59,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 13] total 22 [2024-09-20 12:03:59,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473414925] [2024-09-20 12:03:59,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:59,327 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 12:03:59,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 12:03:59,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2024-09-20 12:03:59,328 INFO L87 Difference]: Start difference. First operand 83 states and 118 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-20 12:03:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:59,432 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-09-20 12:03:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:03:59,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 123 [2024-09-20 12:03:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:59,434 INFO L225 Difference]: With dead ends: 89 [2024-09-20 12:03:59,435 INFO L226 Difference]: Without dead ends: 87 [2024-09-20 12:03:59,435 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 277 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2024-09-20 12:03:59,436 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:59,439 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:03:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-20 12:03:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-20 12:03:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 41 states have call successors, (41), 9 states have call predecessors, (41), 8 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-20 12:03:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-09-20 12:03:59,467 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 123 [2024-09-20 12:03:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:59,469 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-09-20 12:03:59,470 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-20 12:03:59,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2024-09-20 12:03:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-09-20 12:03:59,473 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:59,473 INFO L216 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:59,494 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:03:59,674 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:03:59,674 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:59,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:59,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1411465217, now seen corresponding path program 3 times [2024-09-20 12:03:59,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:59,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926443195] [2024-09-20 12:03:59,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:59,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 12:03:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 12:03:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 12:03:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,915 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 12:03:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 12:03:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 12:03:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 12:03:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,926 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 12:03:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 12:03:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 12:03:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 12:03:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,945 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-20 12:03:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-20 12:03:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-20 12:03:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-20 12:03:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-20 12:03:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-20 12:03:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-20 12:03:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-20 12:03:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-09-20 12:03:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-09-20 12:03:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-09-20 12:03:59,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:59,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926443195] [2024-09-20 12:03:59,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926443195] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:03:59,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720546466] [2024-09-20 12:03:59,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 12:03:59,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:03:59,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:03:59,980 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:03:59,982 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:04:00,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-20 12:04:00,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:04:00,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 12:04:00,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:04:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2024-09-20 12:04:00,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:04:00,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720546466] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:04:00,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 12:04:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-09-20 12:04:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97396927] [2024-09-20 12:04:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:04:00,121 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:04:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:04:00,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:04:00,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-09-20 12:04:00,121 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-20 12:04:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:04:00,184 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2024-09-20 12:04:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:04:00,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 128 [2024-09-20 12:04:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:04:00,186 INFO L225 Difference]: With dead ends: 101 [2024-09-20 12:04:00,186 INFO L226 Difference]: Without dead ends: 99 [2024-09-20 12:04:00,186 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-09-20 12:04:00,187 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:04:00,187 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:04:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-20 12:04:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-09-20 12:04:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 46 states have (on average 1.065217391304348) internal successors, (49), 47 states have internal predecessors, (49), 41 states have call successors, (41), 12 states have call predecessors, (41), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-20 12:04:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2024-09-20 12:04:00,202 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 128 [2024-09-20 12:04:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:04:00,203 INFO L474 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2024-09-20 12:04:00,203 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-20 12:04:00,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2024-09-20 12:04:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-09-20 12:04:00,205 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:04:00,205 INFO L216 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 6, 6, 6, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:04:00,224 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:04:00,405 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-20 12:04:00,406 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:04:00,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1811846900, now seen corresponding path program 4 times [2024-09-20 12:04:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:04:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380376007] [2024-09-20 12:04:00,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:04:00,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:04:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:04:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:04:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 12:04:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 12:04:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 12:04:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 12:04:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 12:04:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 12:04:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 12:04:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 12:04:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 12:04:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 12:04:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 12:04:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-20 12:04:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-20 12:04:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-20 12:04:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-20 12:04:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-20 12:04:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,715 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-20 12:04:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-20 12:04:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-20 12:04:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-09-20 12:04:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-09-20 12:04:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-09-20 12:04:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-09-20 12:04:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,739 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-09-20 12:04:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-09-20 12:04:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 56 proven. 70 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2024-09-20 12:04:00,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:04:00,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380376007] [2024-09-20 12:04:00,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380376007] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:04:00,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223905431] [2024-09-20 12:04:00,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 12:04:00,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:04:00,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:04:00,748 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:04:00,750 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:04:00,833 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 12:04:00,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:04:00,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-20 12:04:00,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:04:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 77 proven. 52 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-09-20 12:04:01,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:04:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 52 proven. 73 refuted. 0 times theorem prover too weak. 1304 trivial. 0 not checked. [2024-09-20 12:04:01,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223905431] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:04:01,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:04:01,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 23 [2024-09-20 12:04:01,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005821127] [2024-09-20 12:04:01,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:04:01,273 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-20 12:04:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:04:01,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-20 12:04:01,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-09-20 12:04:01,276 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 14 states have call successors, (55), 3 states have call predecessors, (55), 1 states have return successors, (51), 14 states have call predecessors, (51), 14 states have call successors, (51) [2024-09-20 12:04:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:04:01,845 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2024-09-20 12:04:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-20 12:04:01,845 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 14 states have call successors, (55), 3 states have call predecessors, (55), 1 states have return successors, (51), 14 states have call predecessors, (51), 14 states have call successors, (51) Word has length 149 [2024-09-20 12:04:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:04:01,846 INFO L225 Difference]: With dead ends: 164 [2024-09-20 12:04:01,846 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 12:04:01,849 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 338 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2024-09-20 12:04:01,849 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-20 12:04:01,850 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 182 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-20 12:04:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 12:04:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 12:04:01,850 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:04:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 12:04:01,850 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2024-09-20 12:04:01,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:04:01,851 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 12:04:01,851 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 14 states have call successors, (55), 3 states have call predecessors, (55), 1 states have return successors, (51), 14 states have call predecessors, (51), 14 states have call successors, (51) [2024-09-20 12:04:01,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 12:04:01,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 12:04:01,854 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 12:04:01,873 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-20 12:04:02,058 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:04:02,061 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-09-20 12:04:02,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 12:04:02,951 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 12:04:02,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:04:02 BoogieIcfgContainer [2024-09-20 12:04:02,968 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 12:04:02,969 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 12:04:02,969 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 12:04:02,969 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 12:04:02,969 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:03:55" (3/4) ... [2024-09-20 12:04:02,971 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 12:04:03,027 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 12:04:03,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 12:04:03,028 INFO L158 Benchmark]: Toolchain (without parser) took 8310.76ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 118.7MB in the beginning and 189.4MB in the end (delta: -70.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:04:03,028 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:04:03,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.04ms. Allocated memory is still 176.2MB. Free memory was 118.2MB in the beginning and 107.2MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 12:04:03,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.46ms. Allocated memory is still 176.2MB. Free memory was 107.2MB in the beginning and 106.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:04:03,029 INFO L158 Benchmark]: Boogie Preprocessor took 28.01ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 104.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:04:03,029 INFO L158 Benchmark]: RCFGBuilder took 366.73ms. Allocated memory is still 176.2MB. Free memory was 104.6MB in the beginning and 92.5MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 12:04:03,030 INFO L158 Benchmark]: TraceAbstraction took 7592.83ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 91.5MB in the beginning and 191.5MB in the end (delta: -100.0MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2024-09-20 12:04:03,030 INFO L158 Benchmark]: Witness Printer took 58.97ms. Allocated memory is still 228.6MB. Free memory was 191.5MB in the beginning and 189.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:04:03,031 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.20ms. Allocated memory is still 176.2MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.04ms. Allocated memory is still 176.2MB. Free memory was 118.2MB in the beginning and 107.2MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.46ms. Allocated memory is still 176.2MB. Free memory was 107.2MB in the beginning and 106.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.01ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 104.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.73ms. Allocated memory is still 176.2MB. Free memory was 104.6MB in the beginning and 92.5MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7592.83ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 91.5MB in the beginning and 191.5MB in the end (delta: -100.0MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. * Witness Printer took 58.97ms. Allocated memory is still 228.6MB. Free memory was 191.5MB in the beginning and 189.4MB 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: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 10, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 996 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 743 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 635 IncrementalHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 253 mSDtfsCounter, 635 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1145 GetRequests, 1025 SyntacticMatches, 13 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1094 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1430 ConstructedInterpolants, 0 QuantifiedInterpolants, 2406 SizeOfPredicates, 4 NumberOfNonLiveVariables, 794 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 9996/10307 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: 18]: Loop Invariant Derived loop invariant: ((((j == 0) && (0 <= i)) && (i <= 3)) || ((((i <= ((long long) j + 3)) && (1 <= j)) && (j <= i)) && (j <= 4))) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((i <= 4) && (0 <= i)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-20 12:04:03,060 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