./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_5.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-simple/nested_5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d0f32d2f39934bb8fd732fa206acfa5d2fb4cacaee37919c0e4326d55891c86 --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:59:37,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 18:59:37,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 18:59:37,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 18:59:37,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 18:59:37,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 18:59:37,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 18:59:37,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 18:59:37,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 18:59:37,722 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 18:59:37,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 18:59:37,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 18:59:37,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 18:59:37,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 18:59:37,726 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 18:59:37,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 18:59:37,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 18:59:37,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 18:59:37,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 18:59:37,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 18:59:37,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 18:59:37,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 18:59:37,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 18:59:37,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 18:59:37,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 18:59:37,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 18:59:37,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 18:59:37,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 18:59:37,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 18:59:37,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 18:59:37,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 18:59:37,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 18:59:37,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 18:59:37,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 18:59:37,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 18:59:37,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 18:59:37,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 18:59:37,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 18:59:37,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 18:59:37,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 18:59:37,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 18:59:37,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 18:59:37,738 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 -> 3d0f32d2f39934bb8fd732fa206acfa5d2fb4cacaee37919c0e4326d55891c86 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:59:38,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 18:59:38,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 18:59:38,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 18:59:38,039 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 18:59:38,039 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 18:59:38,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_5.c [2024-09-20 18:59:39,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 18:59:39,703 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 18:59:39,703 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_5.c [2024-09-20 18:59:39,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5884d32f2/3380c1dd17bd49c28154b16de75956ba/FLAG7045a5494 [2024-09-20 18:59:39,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5884d32f2/3380c1dd17bd49c28154b16de75956ba [2024-09-20 18:59:39,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 18:59:39,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 18:59:39,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 18:59:39,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 18:59:39,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 18:59:39,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:39,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c0477b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39, skipping insertion in model container [2024-09-20 18:59:39,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:39,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 18:59:39,935 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-simple/nested_5.c[899,912] [2024-09-20 18:59:39,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 18:59:39,956 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 18:59:39,969 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-simple/nested_5.c[899,912] [2024-09-20 18:59:39,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 18:59:39,986 INFO L204 MainTranslator]: Completed translation [2024-09-20 18:59:39,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39 WrapperNode [2024-09-20 18:59:39,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 18:59:39,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 18:59:39,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 18:59:39,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 18:59:39,996 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:59:39" (1/1) ... [2024-09-20 18:59:40,002 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:59:39" (1/1) ... [2024-09-20 18:59:40,010 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 18:59:40,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 18:59:40,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 18:59:40,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 18:59:40,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 18:59:40,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:40,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:40,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:40,034 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:59:40,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:40,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:40,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:40,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:40,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:40,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:40,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 18:59:40,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 18:59:40,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 18:59:40,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 18:59:40,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (1/1) ... [2024-09-20 18:59:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 18:59:40,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:59:40,090 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:59:40,093 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:59:40,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 18:59:40,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 18:59:40,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 18:59:40,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 18:59:40,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 18:59:40,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 18:59:40,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 18:59:40,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 18:59:40,209 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 18:59:40,212 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 18:59:40,363 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-20 18:59:40,364 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 18:59:40,395 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 18:59:40,395 INFO L318 CfgBuilder]: Removed 5 assume(true) statements. [2024-09-20 18:59:40,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 06:59:40 BoogieIcfgContainer [2024-09-20 18:59:40,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 18:59:40,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 18:59:40,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 18:59:40,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 18:59:40,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 06:59:39" (1/3) ... [2024-09-20 18:59:40,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37207070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 06:59:40, skipping insertion in model container [2024-09-20 18:59:40,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:59:39" (2/3) ... [2024-09-20 18:59:40,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37207070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 06:59:40, skipping insertion in model container [2024-09-20 18:59:40,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 06:59:40" (3/3) ... [2024-09-20 18:59:40,408 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_5.c [2024-09-20 18:59:40,436 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 18:59:40,437 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 18:59:40,495 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 18:59:40,503 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;@583ab7c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 18:59:40,503 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 18:59:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-20 18:59:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-20 18:59:40,514 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:40,515 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:40,515 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:40,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:40,521 INFO L85 PathProgramCache]: Analyzing trace with hash 424554851, now seen corresponding path program 1 times [2024-09-20 18:59:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618184643] [2024-09-20 18:59:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:40,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:40,673 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:59:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618184643] [2024-09-20 18:59:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618184643] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:59:40,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:59:40,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 18:59:40,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376823884] [2024-09-20 18:59:40,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:59:40,685 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 18:59:40,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 18:59:40,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 18:59:40,714 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:40,746 INFO L93 Difference]: Finished difference Result 37 states and 57 transitions. [2024-09-20 18:59:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 18:59:40,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-20 18:59:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:40,756 INFO L225 Difference]: With dead ends: 37 [2024-09-20 18:59:40,757 INFO L226 Difference]: Without dead ends: 17 [2024-09-20 18:59:40,760 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 18:59:40,763 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:40,764 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-20 18:59:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-20 18:59:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-09-20 18:59:40,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2024-09-20 18:59:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:40,798 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-09-20 18:59:40,799 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:40,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-09-20 18:59:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-20 18:59:40,800 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:40,800 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:40,801 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 18:59:40,801 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:40,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash 424502957, now seen corresponding path program 1 times [2024-09-20 18:59:40,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:40,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925566193] [2024-09-20 18:59:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:40,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:40,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:40,929 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:59:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:40,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925566193] [2024-09-20 18:59:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925566193] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:59:40,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:59:40,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 18:59:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446331869] [2024-09-20 18:59:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:59:40,932 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 18:59:40,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:40,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 18:59:40,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 18:59:40,934 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:40,976 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-09-20 18:59:40,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 18:59:40,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-20 18:59:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:40,977 INFO L225 Difference]: With dead ends: 29 [2024-09-20 18:59:40,977 INFO L226 Difference]: Without dead ends: 26 [2024-09-20 18:59:40,978 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:59:40,983 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:40,984 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:40,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-20 18:59:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2024-09-20 18:59:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-09-20 18:59:40,995 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2024-09-20 18:59:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:40,996 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-09-20 18:59:40,996 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:40,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-09-20 18:59:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 18:59:40,998 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:40,998 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:40,998 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 18:59:40,999 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:41,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1994759058, now seen corresponding path program 1 times [2024-09-20 18:59:41,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:41,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961891588] [2024-09-20 18:59:41,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 18:59:41,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:41,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961891588] [2024-09-20 18:59:41,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961891588] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:59:41,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:59:41,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 18:59:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322503947] [2024-09-20 18:59:41,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:59:41,085 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 18:59:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:41,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 18:59:41,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 18:59:41,087 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:41,127 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-09-20 18:59:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 18:59:41,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 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:59:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:41,130 INFO L225 Difference]: With dead ends: 37 [2024-09-20 18:59:41,130 INFO L226 Difference]: Without dead ends: 25 [2024-09-20 18:59:41,130 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:59:41,131 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:41,132 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-20 18:59:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2024-09-20 18:59:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-09-20 18:59:41,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2024-09-20 18:59:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:41,143 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-09-20 18:59:41,143 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-09-20 18:59:41,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-20 18:59:41,144 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:41,144 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:41,144 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 18:59:41,144 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:41,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:41,145 INFO L85 PathProgramCache]: Analyzing trace with hash -667291207, now seen corresponding path program 1 times [2024-09-20 18:59:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:41,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287215035] [2024-09-20 18:59:41,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,231 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:59:41,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:41,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287215035] [2024-09-20 18:59:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287215035] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:59:41,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:59:41,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 18:59:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436341938] [2024-09-20 18:59:41,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:59:41,236 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 18:59:41,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:41,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 18:59:41,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 18:59:41,237 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:41,269 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2024-09-20 18:59:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 18:59:41,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-20 18:59:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:41,271 INFO L225 Difference]: With dead ends: 37 [2024-09-20 18:59:41,271 INFO L226 Difference]: Without dead ends: 24 [2024-09-20 18:59:41,272 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:59:41,273 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:41,273 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-20 18:59:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-09-20 18:59:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-09-20 18:59:41,283 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2024-09-20 18:59:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:41,283 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-09-20 18:59:41,283 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:41,284 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-09-20 18:59:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-20 18:59:41,284 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:41,284 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:41,285 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 18:59:41,285 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:41,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash -73398794, now seen corresponding path program 1 times [2024-09-20 18:59:41,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:41,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122209593] [2024-09-20 18:59:41,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:41,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 18:59:41,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:41,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122209593] [2024-09-20 18:59:41,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122209593] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:59:41,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:59:41,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 18:59:41,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250441271] [2024-09-20 18:59:41,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:59:41,354 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 18:59:41,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:41,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 18:59:41,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 18:59:41,355 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:41,379 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-09-20 18:59:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 18:59:41,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-20 18:59:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:41,381 INFO L225 Difference]: With dead ends: 37 [2024-09-20 18:59:41,381 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 18:59:41,382 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:59:41,383 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:41,383 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 18:59:41,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-09-20 18:59:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-20 18:59:41,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 17 [2024-09-20 18:59:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:41,393 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-20 18:59:41,394 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-20 18:59:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-20 18:59:41,396 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:41,397 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:41,397 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 18:59:41,397 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:41,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1923600117, now seen corresponding path program 1 times [2024-09-20 18:59:41,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:41,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708268899] [2024-09-20 18:59:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:41,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 18:59:41,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:41,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708268899] [2024-09-20 18:59:41,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708268899] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:59:41,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:59:41,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 18:59:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516121319] [2024-09-20 18:59:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:59:41,490 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 18:59:41,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 18:59:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 18:59:41,491 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:41,511 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-09-20 18:59:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 18:59:41,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-20 18:59:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:41,512 INFO L225 Difference]: With dead ends: 37 [2024-09-20 18:59:41,512 INFO L226 Difference]: Without dead ends: 22 [2024-09-20 18:59:41,512 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:59:41,513 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:41,514 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-20 18:59:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-20 18:59:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-09-20 18:59:41,521 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20 [2024-09-20 18:59:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:41,522 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-09-20 18:59:41,522 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-09-20 18:59:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-20 18:59:41,526 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:41,526 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:41,527 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 18:59:41,527 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:41,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 406923681, now seen corresponding path program 1 times [2024-09-20 18:59:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:41,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63403806] [2024-09-20 18:59:41,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 18:59:41,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:41,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63403806] [2024-09-20 18:59:41,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63403806] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 18:59:41,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146968163] [2024-09-20 18:59:41,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:41,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 18:59:41,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:59:41,642 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:59:41,644 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:59:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:41,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-20 18:59:41,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 18:59:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 18:59:41,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 18:59:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 18:59:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146968163] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 18:59:41,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 18:59:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-20 18:59:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492764852] [2024-09-20 18:59:41,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 18:59:41,807 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 18:59:41,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:41,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 18:59:41,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-20 18:59:41,812 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:41,843 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-09-20 18:59:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 18:59:41,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-20 18:59:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:41,845 INFO L225 Difference]: With dead ends: 41 [2024-09-20 18:59:41,845 INFO L226 Difference]: Without dead ends: 25 [2024-09-20 18:59:41,846 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-20 18:59:41,847 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:41,848 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-20 18:59:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-20 18:59:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-20 18:59:41,860 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 21 [2024-09-20 18:59:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:41,861 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-20 18:59:41,861 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:41,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-20 18:59:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-20 18:59:41,862 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:41,864 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:41,879 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:59:42,065 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:59:42,065 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:42,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:42,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1149298187, now seen corresponding path program 2 times [2024-09-20 18:59:42,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:42,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379363590] [2024-09-20 18:59:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:42,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:42,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-20 18:59:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:42,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379363590] [2024-09-20 18:59:42,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379363590] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 18:59:42,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957080787] [2024-09-20 18:59:42,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 18:59:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 18:59:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:59:42,128 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:59:42,129 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:59:42,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 18:59:42,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 18:59:42,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 18:59:42,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 18:59:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 18:59:42,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 18:59:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 18:59:42,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957080787] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 18:59:42,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 18:59:42,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-20 18:59:42,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289443973] [2024-09-20 18:59:42,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 18:59:42,334 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 18:59:42,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:42,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 18:59:42,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-20 18:59:42,340 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:42,520 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-09-20 18:59:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-20 18:59:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-09-20 18:59:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:42,522 INFO L225 Difference]: With dead ends: 63 [2024-09-20 18:59:42,522 INFO L226 Difference]: Without dead ends: 44 [2024-09-20 18:59:42,523 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-20 18:59:42,523 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:42,523 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-20 18:59:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-09-20 18:59:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-09-20 18:59:42,535 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2024-09-20 18:59:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:42,536 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-09-20 18:59:42,536 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:42,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-09-20 18:59:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-20 18:59:42,539 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:42,539 INFO L216 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:42,556 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:59:42,743 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:59:42,744 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:42,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:42,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1491254058, now seen corresponding path program 3 times [2024-09-20 18:59:42,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:42,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773671764] [2024-09-20 18:59:42,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:42,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:42,800 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-20 18:59:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773671764] [2024-09-20 18:59:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773671764] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 18:59:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501146436] [2024-09-20 18:59:42,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 18:59:42,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 18:59:42,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:59:42,806 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:59:42,809 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:59:42,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-20 18:59:42,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 18:59:42,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-20 18:59:42,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 18:59:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-09-20 18:59:42,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 18:59:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-09-20 18:59:42,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501146436] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 18:59:42,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 18:59:42,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-09-20 18:59:42,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137372890] [2024-09-20 18:59:42,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 18:59:42,979 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 18:59:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 18:59:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-20 18:59:42,980 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:43,130 INFO L93 Difference]: Finished difference Result 311 states and 367 transitions. [2024-09-20 18:59:43,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 18:59:43,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-09-20 18:59:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:43,133 INFO L225 Difference]: With dead ends: 311 [2024-09-20 18:59:43,133 INFO L226 Difference]: Without dead ends: 281 [2024-09-20 18:59:43,133 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-09-20 18:59:43,134 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 76 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:43,134 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 18:59:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-09-20 18:59:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 201. [2024-09-20 18:59:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.16751269035533) internal successors, (230), 197 states have internal predecessors, (230), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2024-09-20 18:59:43,186 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 35 [2024-09-20 18:59:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:43,186 INFO L474 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2024-09-20 18:59:43,186 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:43,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2024-09-20 18:59:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-09-20 18:59:43,191 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:43,191 INFO L216 NwaCegarLoop]: trace histogram [96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:43,205 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-20 18:59:43,392 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:59:43,392 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:43,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1947569315, now seen corresponding path program 4 times [2024-09-20 18:59:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:43,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217017633] [2024-09-20 18:59:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:43,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6756 backedges. 2566 proven. 1 refuted. 0 times theorem prover too weak. 4189 trivial. 0 not checked. [2024-09-20 18:59:43,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:43,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217017633] [2024-09-20 18:59:43,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217017633] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 18:59:43,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800462824] [2024-09-20 18:59:43,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 18:59:43,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 18:59:43,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:59:43,608 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:59:43,609 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:59:43,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 18:59:43,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 18:59:43,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 18:59:43,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 18:59:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6756 backedges. 1485 proven. 53 refuted. 0 times theorem prover too weak. 5218 trivial. 0 not checked. [2024-09-20 18:59:43,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 18:59:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6756 backedges. 1485 proven. 53 refuted. 0 times theorem prover too weak. 5218 trivial. 0 not checked. [2024-09-20 18:59:43,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800462824] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 18:59:43,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 18:59:43,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-09-20 18:59:43,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107448105] [2024-09-20 18:59:43,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 18:59:43,878 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 18:59:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:43,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 18:59:43,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-20 18:59:43,879 INFO L87 Difference]: Start difference. First operand 201 states and 233 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:44,215 INFO L93 Difference]: Finished difference Result 1615 states and 1931 transitions. [2024-09-20 18:59:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-20 18:59:44,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 200 [2024-09-20 18:59:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:44,224 INFO L225 Difference]: With dead ends: 1615 [2024-09-20 18:59:44,224 INFO L226 Difference]: Without dead ends: 1421 [2024-09-20 18:59:44,226 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-20 18:59:44,227 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:44,227 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 52 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-09-20 18:59:44,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 957. [2024-09-20 18:59:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 953 states have (on average 1.131164742917104) internal successors, (1078), 953 states have internal predecessors, (1078), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1081 transitions. [2024-09-20 18:59:44,416 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1081 transitions. Word has length 200 [2024-09-20 18:59:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:44,417 INFO L474 AbstractCegarLoop]: Abstraction has 957 states and 1081 transitions. [2024-09-20 18:59:44,417 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:44,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1081 transitions. [2024-09-20 18:59:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2024-09-20 18:59:44,446 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:44,446 INFO L216 NwaCegarLoop]: trace histogram [576, 96, 96, 96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:44,463 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:59:44,646 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:59:44,647 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:44,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1117550867, now seen corresponding path program 5 times [2024-09-20 18:59:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090335204] [2024-09-20 18:59:44,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:45,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 236738 backedges. 51878 proven. 1853 refuted. 0 times theorem prover too weak. 183007 trivial. 0 not checked. [2024-09-20 18:59:45,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090335204] [2024-09-20 18:59:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090335204] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 18:59:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801046272] [2024-09-20 18:59:45,902 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-20 18:59:45,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 18:59:45,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:59:45,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 18:59:45,906 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-20 18:59:46,120 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2024-09-20 18:59:46,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 18:59:46,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 18:59:46,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 18:59:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 236738 backedges. 126006 proven. 1853 refuted. 0 times theorem prover too weak. 108879 trivial. 0 not checked. [2024-09-20 18:59:46,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 18:59:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 236738 backedges. 126006 proven. 1853 refuted. 0 times theorem prover too weak. 108879 trivial. 0 not checked. [2024-09-20 18:59:46,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801046272] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 18:59:46,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 18:59:46,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-20 18:59:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164700403] [2024-09-20 18:59:46,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 18:59:46,571 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 18:59:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:46,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 18:59:46,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-20 18:59:46,572 INFO L87 Difference]: Start difference. First operand 957 states and 1081 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:47,045 INFO L93 Difference]: Finished difference Result 3616 states and 4105 transitions. [2024-09-20 18:59:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 18:59:47,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 956 [2024-09-20 18:59:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:47,057 INFO L225 Difference]: With dead ends: 3616 [2024-09-20 18:59:47,058 INFO L226 Difference]: Without dead ends: 2781 [2024-09-20 18:59:47,061 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1918 GetRequests, 1911 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-20 18:59:47,061 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 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:59:47,062 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2024-09-20 18:59:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2781. [2024-09-20 18:59:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2777 states have (on average 1.1256751890529348) internal successors, (3126), 2777 states have internal predecessors, (3126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:47,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3129 transitions. [2024-09-20 18:59:47,347 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3129 transitions. Word has length 956 [2024-09-20 18:59:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:47,348 INFO L474 AbstractCegarLoop]: Abstraction has 2781 states and 3129 transitions. [2024-09-20 18:59:47,348 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:47,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3129 transitions. [2024-09-20 18:59:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2781 [2024-09-20 18:59:47,414 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:47,414 INFO L216 NwaCegarLoop]: trace histogram [1728, 288, 288, 288, 48, 48, 48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:47,426 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-20 18:59:47,615 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-20 18:59:47,615 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:47,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1702199533, now seen corresponding path program 6 times [2024-09-20 18:59:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:47,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40470989] [2024-09-20 18:59:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:59:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:51,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:59:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:59:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2131506 backedges. 799831 proven. 66653 refuted. 0 times theorem prover too weak. 1265022 trivial. 0 not checked. [2024-09-20 18:59:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:59:52,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40470989] [2024-09-20 18:59:52,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40470989] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 18:59:52,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619930697] [2024-09-20 18:59:52,059 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-20 18:59:52,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 18:59:52,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:59:52,061 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 18:59:52,062 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-20 18:59:55,546 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 465 check-sat command(s) [2024-09-20 18:59:55,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 18:59:55,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 5411 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 18:59:55,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 18:59:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2131506 backedges. 799834 proven. 66653 refuted. 0 times theorem prover too weak. 1265019 trivial. 0 not checked. [2024-09-20 18:59:56,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 18:59:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2131506 backedges. 799834 proven. 66653 refuted. 0 times theorem prover too weak. 1265019 trivial. 0 not checked. [2024-09-20 18:59:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619930697] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 18:59:57,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 18:59:57,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-20 18:59:57,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080457165] [2024-09-20 18:59:57,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 18:59:57,256 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 18:59:57,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:59:57,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 18:59:57,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-20 18:59:57,257 INFO L87 Difference]: Start difference. First operand 2781 states and 3129 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:59:58,239 INFO L93 Difference]: Finished difference Result 10385 states and 11698 transitions. [2024-09-20 18:59:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 18:59:58,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 2780 [2024-09-20 18:59:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:59:58,274 INFO L225 Difference]: With dead ends: 10385 [2024-09-20 18:59:58,275 INFO L226 Difference]: Without dead ends: 8301 [2024-09-20 18:59:58,281 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5566 GetRequests, 5559 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-20 18:59:58,281 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:59:58,282 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 18:59:58,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8301 states. [2024-09-20 18:59:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8301 to 8301. [2024-09-20 18:59:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8301 states, 8297 states have (on average 1.1249849343136074) internal successors, (9334), 8297 states have internal predecessors, (9334), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8301 states to 8301 states and 9337 transitions. [2024-09-20 18:59:59,079 INFO L78 Accepts]: Start accepts. Automaton has 8301 states and 9337 transitions. Word has length 2780 [2024-09-20 18:59:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:59:59,081 INFO L474 AbstractCegarLoop]: Abstraction has 8301 states and 9337 transitions. [2024-09-20 18:59:59,082 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 18:59:59,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 8301 states and 9337 transitions. [2024-09-20 18:59:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8301 [2024-09-20 18:59:59,383 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:59:59,385 INFO L216 NwaCegarLoop]: trace histogram [5184, 864, 864, 864, 144, 144, 144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:59:59,404 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-20 18:59:59,585 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-20 18:59:59,586 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:59:59,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:59:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash -245490195, now seen corresponding path program 7 times [2024-09-20 18:59:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:59:59,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618733505] [2024-09-20 18:59:59,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:59:59,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:41,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 19191466 backedges. 0 proven. 14396710 refuted. 0 times theorem prover too weak. 4794756 trivial. 0 not checked. [2024-09-20 19:00:42,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618733505] [2024-09-20 19:00:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618733505] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:00:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734867254] [2024-09-20 19:00:42,198 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-20 19:00:42,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:00:42,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:00:42,199 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 19:00:42,200 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-20 19:00:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:45,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 21809 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 19:00:45,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:00:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 19191466 backedges. 0 proven. 14396710 refuted. 0 times theorem prover too weak. 4794756 trivial. 0 not checked. [2024-09-20 19:00:53,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:01:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 19191466 backedges. 0 proven. 14396710 refuted. 0 times theorem prover too weak. 4794756 trivial. 0 not checked. [2024-09-20 19:01:01,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734867254] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:01:01,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:01:01,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-09-20 19:01:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731052912] [2024-09-20 19:01:01,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:01:01,214 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 19:01:01,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:01:01,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 19:01:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-20 19:01:01,215 INFO L87 Difference]: Start difference. First operand 8301 states and 9337 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 19:01:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:01:02,369 INFO L93 Difference]: Finished difference Result 12450 states and 14005 transitions. [2024-09-20 19:01:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 19:01:02,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8300 [2024-09-20 19:01:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:01:02,434 INFO L225 Difference]: With dead ends: 12450 [2024-09-20 19:01:02,434 INFO L226 Difference]: Without dead ends: 12447 [2024-09-20 19:01:02,439 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16608 GetRequests, 16597 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-20 19:01:02,442 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:01:02,442 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:01:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12447 states. [2024-09-20 19:01:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12447 to 12447. [2024-09-20 19:01:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12447 states, 12443 states have (on average 1.1249698625733344) internal successors, (13998), 12443 states have internal predecessors, (13998), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 19:01:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12447 states to 12447 states and 14001 transitions. [2024-09-20 19:01:03,888 INFO L78 Accepts]: Start accepts. Automaton has 12447 states and 14001 transitions. Word has length 8300 [2024-09-20 19:01:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:01:03,901 INFO L474 AbstractCegarLoop]: Abstraction has 12447 states and 14001 transitions. [2024-09-20 19:01:03,902 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 19:01:03,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:01:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 12447 states and 14001 transitions. [2024-09-20 19:01:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12447 [2024-09-20 19:01:04,825 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:01:04,828 INFO L216 NwaCegarLoop]: trace histogram [7776, 1296, 1296, 1296, 216, 216, 216, 36, 36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:01:04,877 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-20 19:01:05,028 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:01:05,028 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:01:05,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:01:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash -837436019, now seen corresponding path program 8 times [2024-09-20 19:01:05,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:01:05,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499554513] [2024-09-20 19:01:05,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:01:05,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms