./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 ca4ee3dd 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-ca4ee3d-m [2024-09-20 18:47:32,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 18:47:32,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 18:47:32,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 18:47:32,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 18:47:32,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 18:47:32,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 18:47:32,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 18:47:32,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 18:47:32,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 18:47:32,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 18:47:32,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 18:47:32,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 18:47:32,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 18:47:32,572 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 18:47:32,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 18:47:32,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 18:47:32,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 18:47:32,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 18:47:32,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 18:47:32,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 18:47:32,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 18:47:32,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 18:47:32,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 18:47:32,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 18:47:32,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 18:47:32,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 18:47:32,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 18:47:32,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 18:47:32,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 18:47:32,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 18:47:32,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 18:47:32,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 18:47:32,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 18:47:32,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 18:47:32,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 18:47:32,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 18:47:32,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 18:47:32,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 18:47:32,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 18:47:32,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 18:47:32,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 18:47:32,580 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 18:47:32,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 18:47:32,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 18:47:32,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 18:47:32,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 18:47:32,841 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 18:47:32,842 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 18:47:34,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 18:47:34,440 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 18:47:34,440 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-20 18:47:34,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/cb4a0a969/9794b23adc9d49adbd10a1ace8c2853b/FLAG6ba5f7d0d [2024-09-20 18:47:34,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/cb4a0a969/9794b23adc9d49adbd10a1ace8c2853b [2024-09-20 18:47:34,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 18:47:34,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 18:47:34,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 18:47:34,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 18:47:34,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 18:47:34,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 06:47:34" (1/1) ... [2024-09-20 18:47:34,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46eb9a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:34, skipping insertion in model container [2024-09-20 18:47:34,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 06:47:34" (1/1) ... [2024-09-20 18:47:34,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 18:47:35,014 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 18:47:35,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 18:47:35,035 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 18:47:35,046 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 18:47:35,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 18:47:35,066 INFO L204 MainTranslator]: Completed translation [2024-09-20 18:47:35,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35 WrapperNode [2024-09-20 18:47:35,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 18:47:35,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 18:47:35,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 18:47:35,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 18:47:35,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,092 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 18:47:35,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 18:47:35,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 18:47:35,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 18:47:35,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 18:47:35,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,115 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 18:47:35,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 18:47:35,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 18:47:35,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 18:47:35,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 18:47:35,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (1/1) ... [2024-09-20 18:47:35,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 18:47:35,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:47:35,156 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 18:47:35,160 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 18:47:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 18:47:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 18:47:35,201 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 18:47:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 18:47:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 18:47:35,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 18:47:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 18:47:35,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 18:47:35,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 18:47:35,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 18:47:35,253 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 18:47:35,255 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 18:47:35,372 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-20 18:47:35,372 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 18:47:35,391 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 18:47:35,392 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 18:47:35,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 06:47:35 BoogieIcfgContainer [2024-09-20 18:47:35,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 18:47:35,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 18:47:35,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 18:47:35,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 18:47:35,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 06:47:34" (1/3) ... [2024-09-20 18:47:35,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5674206d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 06:47:35, skipping insertion in model container [2024-09-20 18:47:35,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:47:35" (2/3) ... [2024-09-20 18:47:35,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5674206d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 06:47:35, skipping insertion in model container [2024-09-20 18:47:35,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 06:47:35" (3/3) ... [2024-09-20 18:47:35,400 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-09-20 18:47:35,413 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 18:47:35,413 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 18:47:35,471 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 18:47:35,477 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;@77d18074, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 18:47:35,478 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 18:47:35,481 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 18:47:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 18:47:35,501 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:47:35,501 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:47:35,502 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:47:35,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:35,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1205805759, now seen corresponding path program 1 times [2024-09-20 18:47:35,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:47:35,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523655062] [2024-09-20 18:47:35,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:35,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:47:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:35,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:47:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:35,697 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 18:47:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:47:35,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523655062] [2024-09-20 18:47:35,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523655062] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:47:35,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:47:35,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 18:47:35,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744669340] [2024-09-20 18:47:35,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:47:35,709 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 18:47:35,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:47:35,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 18:47:35,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 18:47:35,743 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 18:47:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:47:35,780 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2024-09-20 18:47:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 18:47:35,783 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 18:47:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:47:35,789 INFO L225 Difference]: With dead ends: 48 [2024-09-20 18:47:35,790 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 18:47:35,792 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 18:47:35,795 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 18:47:35,796 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 18:47:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 18:47:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-20 18:47:35,830 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 18:47:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-09-20 18:47:35,833 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 11 [2024-09-20 18:47:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:47:35,834 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-09-20 18:47:35,834 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 18:47:35,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-09-20 18:47:35,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 18:47:35,836 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:47:35,836 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:47:35,836 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 18:47:35,836 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:47:35,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1204197045, now seen corresponding path program 1 times [2024-09-20 18:47:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:47:35,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115842265] [2024-09-20 18:47:35,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:35,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:47:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:35,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:47:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,009 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 18:47:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:47:36,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115842265] [2024-09-20 18:47:36,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115842265] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:47:36,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:47:36,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 18:47:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118586778] [2024-09-20 18:47:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:47:36,014 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 18:47:36,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:47:36,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 18:47:36,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 18:47:36,016 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 18:47:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:47:36,120 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-09-20 18:47:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 18:47:36,121 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 18:47:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:47:36,122 INFO L225 Difference]: With dead ends: 29 [2024-09-20 18:47:36,122 INFO L226 Difference]: Without dead ends: 27 [2024-09-20 18:47:36,123 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 18:47:36,124 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 18:47:36,125 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 18:47:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-20 18:47:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-20 18:47:36,140 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 18:47:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-09-20 18:47:36,142 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2024-09-20 18:47:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:47:36,142 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-09-20 18:47:36,142 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 18:47:36,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-09-20 18:47:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 18:47:36,143 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:47:36,143 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:47:36,144 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 18:47:36,144 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:47:36,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1149323679, now seen corresponding path program 1 times [2024-09-20 18:47:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:47:36,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190663261] [2024-09-20 18:47:36,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:36,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:47:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,314 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:47:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 18:47:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,326 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 18:47:36,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:47:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190663261] [2024-09-20 18:47:36,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190663261] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:47:36,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:47:36,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 18:47:36,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824359832] [2024-09-20 18:47:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:47:36,328 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 18:47:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:47:36,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 18:47:36,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 18:47:36,329 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 18:47:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:47:36,430 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2024-09-20 18:47:36,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 18:47:36,430 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 18:47:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:47:36,432 INFO L225 Difference]: With dead ends: 45 [2024-09-20 18:47:36,432 INFO L226 Difference]: Without dead ends: 43 [2024-09-20 18:47:36,433 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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 18:47:36,434 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 18:47:36,434 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 18:47:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-20 18:47:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-09-20 18:47:36,449 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 18:47:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-09-20 18:47:36,451 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 16 [2024-09-20 18:47:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:47:36,452 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-09-20 18:47:36,453 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 18:47:36,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-09-20 18:47:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-20 18:47:36,455 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:47:36,456 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 18:47:36,456 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 18:47:36,457 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:47:36,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash 429495691, now seen corresponding path program 1 times [2024-09-20 18:47:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:47:36,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709194436] [2024-09-20 18:47:36,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:36,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:47:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:47:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 18:47:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 18:47:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,623 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 18:47:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:47:36,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709194436] [2024-09-20 18:47:36,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709194436] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:47:36,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:47:36,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 18:47:36,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353428788] [2024-09-20 18:47:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:47:36,626 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 18:47:36,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:47:36,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 18:47:36,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 18:47:36,629 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 18:47:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:47:36,721 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-09-20 18:47:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 18:47:36,722 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 18:47:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:47:36,723 INFO L225 Difference]: With dead ends: 49 [2024-09-20 18:47:36,723 INFO L226 Difference]: Without dead ends: 47 [2024-09-20 18:47:36,724 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 18:47:36,725 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 18:47:36,725 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 18:47:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-20 18:47:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-09-20 18:47:36,739 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 18:47:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-09-20 18:47:36,741 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 21 [2024-09-20 18:47:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:47:36,742 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-09-20 18:47:36,743 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 18:47:36,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-09-20 18:47:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-20 18:47:36,744 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:47:36,744 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 18:47:36,744 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 18:47:36,745 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:47:36,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:36,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1103951071, now seen corresponding path program 1 times [2024-09-20 18:47:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:47:36,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255634365] [2024-09-20 18:47:36,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:36,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:47:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:47:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 18:47:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 18:47:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 18:47:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:36,850 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 18:47:36,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:47:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255634365] [2024-09-20 18:47:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255634365] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:47:36,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:47:36,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 18:47:36,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095779728] [2024-09-20 18:47:36,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:47:36,855 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 18:47:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:47:36,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 18:47:36,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-20 18:47:36,856 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 18:47:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:47:36,917 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2024-09-20 18:47:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 18:47:36,917 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 18:47:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:47:36,920 INFO L225 Difference]: With dead ends: 92 [2024-09-20 18:47:36,922 INFO L226 Difference]: Without dead ends: 59 [2024-09-20 18:47:36,923 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 18:47:36,924 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 18:47:36,924 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 18:47:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-20 18:47:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-20 18:47:36,941 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 18:47:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-09-20 18:47:36,945 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 26 [2024-09-20 18:47:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:47:36,945 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-09-20 18:47:36,945 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 18:47:36,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-09-20 18:47:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-20 18:47:36,947 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:47:36,947 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 18:47:36,947 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 18:47:36,947 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:47:36,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1044941344, now seen corresponding path program 1 times [2024-09-20 18:47:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:47:36,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072060105] [2024-09-20 18:47:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:36,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:47:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:47:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,025 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 18:47:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 18:47:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 18:47:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 18:47:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 18:47:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 18:47:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 18:47:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,042 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 18:47:37,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:47:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072060105] [2024-09-20 18:47:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072060105] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:47:37,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:47:37,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 18:47:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525102065] [2024-09-20 18:47:37,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:47:37,043 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 18:47:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:47:37,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 18:47:37,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 18:47:37,044 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 18:47:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:47:37,096 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2024-09-20 18:47:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 18:47:37,096 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 18:47:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:47:37,098 INFO L225 Difference]: With dead ends: 65 [2024-09-20 18:47:37,101 INFO L226 Difference]: Without dead ends: 63 [2024-09-20 18:47:37,101 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 18:47:37,102 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 18:47:37,103 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 18:47:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-20 18:47:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-20 18:47:37,120 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 18:47:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-09-20 18:47:37,122 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 47 [2024-09-20 18:47:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:47:37,122 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-09-20 18:47:37,123 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 18:47:37,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-09-20 18:47:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-20 18:47:37,125 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:47:37,126 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 18:47:37,126 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 18:47:37,126 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:47:37,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash 733242377, now seen corresponding path program 1 times [2024-09-20 18:47:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:47:37,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028467538] [2024-09-20 18:47:37,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:47:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:47:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 18:47:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 18:47:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 18:47:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 18:47:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 18:47:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 18:47:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 18:47:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 18:47:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 18:47:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 18:47:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 18:47:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 18:47:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-20 18:47:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,312 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 18:47:37,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:47:37,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028467538] [2024-09-20 18:47:37,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028467538] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 18:47:37,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374824906] [2024-09-20 18:47:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:37,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 18:47:37,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:47:37,316 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 18:47:37,317 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 18:47:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:37,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 18:47:37,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 18:47:37,469 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 18:47:37,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 18:47:37,582 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 18:47:37,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374824906] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 18:47:37,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 18:47:37,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-09-20 18:47:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940918779] [2024-09-20 18:47:37,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 18:47:37,583 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 18:47:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:47:37,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 18:47:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-20 18:47:37,585 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 18:47:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:47:37,647 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2024-09-20 18:47:37,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 18:47:37,648 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 18:47:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:47:37,651 INFO L225 Difference]: With dead ends: 129 [2024-09-20 18:47:37,653 INFO L226 Difference]: Without dead ends: 83 [2024-09-20 18:47:37,654 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-20 18:47:37,656 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 18:47:37,656 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 18:47:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-20 18:47:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-09-20 18:47:37,680 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 18:47:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions. [2024-09-20 18:47:37,683 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 81 [2024-09-20 18:47:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:47:37,684 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 118 transitions. [2024-09-20 18:47:37,684 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 18:47:37,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2024-09-20 18:47:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-09-20 18:47:37,687 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:47:37,687 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 18:47:37,704 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 18:47:37,890 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 18:47:37,891 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:47:37,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1779798679, now seen corresponding path program 2 times [2024-09-20 18:47:37,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:47:37,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334339292] [2024-09-20 18:47:37,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:37,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:47:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,196 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:47:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 18:47:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 18:47:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 18:47:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 18:47:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 18:47:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 18:47:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 18:47:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 18:47:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,234 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 18:47:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 18:47:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 18:47:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 18:47:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-20 18:47:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-20 18:47:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-20 18:47:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-20 18:47:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-20 18:47:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-20 18:47:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-20 18:47:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-20 18:47:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-09-20 18:47:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:38,300 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 18:47:38,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:47:38,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334339292] [2024-09-20 18:47:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334339292] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 18:47:38,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202019813] [2024-09-20 18:47:38,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 18:47:38,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 18:47:38,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:47:38,303 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 18:47:38,304 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 18:47:38,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 18:47:38,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 18:47:38,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-20 18:47:38,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 18:47:38,740 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 18:47:38,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 18:47:38,956 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 18:47:38,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202019813] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 18:47:38,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 18:47:38,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 13] total 22 [2024-09-20 18:47:38,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240871226] [2024-09-20 18:47:38,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:47:38,958 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 18:47:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:47:38,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 18:47:38,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2024-09-20 18:47:38,959 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 18:47:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:47:39,043 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-09-20 18:47:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 18:47:39,043 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 18:47:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:47:39,045 INFO L225 Difference]: With dead ends: 89 [2024-09-20 18:47:39,045 INFO L226 Difference]: Without dead ends: 87 [2024-09-20 18:47:39,046 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 18:47:39,046 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.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:47:39,047 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.0s Time] [2024-09-20 18:47:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-20 18:47:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-20 18:47:39,061 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 18:47:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-09-20 18:47:39,064 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 123 [2024-09-20 18:47:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:47:39,064 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-09-20 18:47:39,064 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 18:47:39,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:39,065 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2024-09-20 18:47:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-09-20 18:47:39,066 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:47:39,066 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 18:47:39,087 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-20 18:47:39,270 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 18:47:39,271 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:47:39,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1411465217, now seen corresponding path program 3 times [2024-09-20 18:47:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:47:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504978426] [2024-09-20 18:47:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:47:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:47:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 18:47:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 18:47:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 18:47:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 18:47:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 18:47:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 18:47:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 18:47:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 18:47:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 18:47:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,538 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 18:47:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,541 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 18:47:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,545 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 18:47:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-20 18:47:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-20 18:47:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-20 18:47:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-20 18:47:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-20 18:47:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-20 18:47:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,570 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-20 18:47:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-20 18:47:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-09-20 18:47:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-09-20 18:47:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:39,582 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 18:47:39,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:47:39,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504978426] [2024-09-20 18:47:39,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504978426] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 18:47:39,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502388267] [2024-09-20 18:47:39,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 18:47:39,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 18:47:39,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:47:39,585 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 18:47:39,587 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 18:47:39,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-20 18:47:39,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 18:47:39,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 18:47:39,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 18:47:39,725 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 18:47:39,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 18:47:39,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502388267] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:47:39,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 18:47:39,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-09-20 18:47:39,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296180066] [2024-09-20 18:47:39,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:47:39,727 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 18:47:39,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:47:39,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 18:47:39,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-09-20 18:47:39,729 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 18:47:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:47:39,791 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2024-09-20 18:47:39,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 18:47:39,791 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 18:47:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:47:39,793 INFO L225 Difference]: With dead ends: 101 [2024-09-20 18:47:39,793 INFO L226 Difference]: Without dead ends: 99 [2024-09-20 18:47:39,793 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 18:47:39,794 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 18:47:39,794 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 18:47:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-20 18:47:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-09-20 18:47:39,808 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 18:47:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2024-09-20 18:47:39,809 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 128 [2024-09-20 18:47:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:47:39,810 INFO L474 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2024-09-20 18:47:39,810 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 18:47:39,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2024-09-20 18:47:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-09-20 18:47:39,812 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:47:39,812 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 18:47:39,828 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 18:47:40,012 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 18:47:40,013 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:47:40,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1811846900, now seen corresponding path program 4 times [2024-09-20 18:47:40,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:47:40,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162523174] [2024-09-20 18:47:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:47:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:47:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:47:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 18:47:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 18:47:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 18:47:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 18:47:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 18:47:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 18:47:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,307 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 18:47:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 18:47:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,314 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 18:47:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 18:47:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 18:47:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 18:47:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-20 18:47:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-20 18:47:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-20 18:47:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-20 18:47:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-20 18:47:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-20 18:47:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-20 18:47:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,344 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-20 18:47:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,346 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-09-20 18:47:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-09-20 18:47:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-09-20 18:47:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-09-20 18:47:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-09-20 18:47:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-09-20 18:47:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:47:40,364 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 18:47:40,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:47:40,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162523174] [2024-09-20 18:47:40,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162523174] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 18:47:40,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480272713] [2024-09-20 18:47:40,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 18:47:40,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 18:47:40,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:47:40,367 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 18:47:40,369 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 18:47:40,444 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 18:47:40,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 18:47:40,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-20 18:47:40,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 18:47:40,632 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 18:47:40,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 18:47:40,863 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 18:47:40,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480272713] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 18:47:40,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 18:47:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 23 [2024-09-20 18:47:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155519845] [2024-09-20 18:47:40,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 18:47:40,864 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-20 18:47:40,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:47:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-20 18:47:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-09-20 18:47:40,865 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 18:47:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:47:41,387 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2024-09-20 18:47:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-20 18:47:41,388 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 18:47:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:47:41,389 INFO L225 Difference]: With dead ends: 164 [2024-09-20 18:47:41,389 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 18:47:41,391 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 18:47:41,392 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 18:47:41,392 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 18:47:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 18:47:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 18:47:41,393 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 18:47:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 18:47:41,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2024-09-20 18:47:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:47:41,393 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 18:47:41,394 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 18:47:41,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:47:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 18:47:41,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 18:47:41,397 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 18:47:41,413 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 18:47:41,597 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 18:47:41,600 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-09-20 18:47:41,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 18:47:42,444 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 18:47:42,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 06:47:42 BoogieIcfgContainer [2024-09-20 18:47:42,471 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 18:47:42,471 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 18:47:42,471 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 18:47:42,472 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 18:47:42,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 06:47:35" (3/4) ... [2024-09-20 18:47:42,474 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 18:47:42,525 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 18:47:42,525 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 18:47:42,526 INFO L158 Benchmark]: Toolchain (without parser) took 7673.62ms. Allocated memory was 159.4MB in the beginning and 268.4MB in the end (delta: 109.1MB). Free memory was 102.3MB in the beginning and 236.4MB in the end (delta: -134.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 18:47:42,526 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 118.3MB in the beginning and 118.2MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 18:47:42,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.03ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 91.1MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 18:47:42,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.16ms. Allocated memory is still 159.4MB. Free memory was 91.1MB in the beginning and 90.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 18:47:42,527 INFO L158 Benchmark]: Boogie Preprocessor took 29.86ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 88.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 18:47:42,527 INFO L158 Benchmark]: RCFGBuilder took 268.68ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 76.5MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 18:47:42,528 INFO L158 Benchmark]: TraceAbstraction took 7076.67ms. Allocated memory was 159.4MB in the beginning and 268.4MB in the end (delta: 109.1MB). Free memory was 75.8MB in the beginning and 238.5MB in the end (delta: -162.8MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. [2024-09-20 18:47:42,528 INFO L158 Benchmark]: Witness Printer took 53.70ms. Allocated memory is still 268.4MB. Free memory was 238.5MB in the beginning and 236.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 18:47:42,530 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 118.3MB in the beginning and 118.2MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.03ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 91.1MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.16ms. Allocated memory is still 159.4MB. Free memory was 91.1MB in the beginning and 90.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.86ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 88.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 268.68ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 76.5MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7076.67ms. Allocated memory was 159.4MB in the beginning and 268.4MB in the end (delta: 109.1MB). Free memory was 75.8MB in the beginning and 238.5MB in the end (delta: -162.8MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. * Witness Printer took 53.70ms. Allocated memory is still 268.4MB. Free memory was 238.5MB in the beginning and 236.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.2s, OverallIterations: 10, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.7s 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, 0.9s 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.2s SatisfiabilityAnalysisTime, 3.2s 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 18:47:42,561 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