./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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:36:18,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:36:18,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:36:18,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:36:18,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:36:18,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:36:18,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:36:18,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:36:18,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:36:18,641 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:36:18,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:36:18,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:36:18,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:36:18,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:36:18,644 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:36:18,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:36:18,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:36:18,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:36:18,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:36:18,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:36:18,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:36:18,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:36:18,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:36:18,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:36:18,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:36:18,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:36:18,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:36:18,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:36:18,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:36:18,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:36:18,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:36:18,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:36:18,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:36:18,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:36:18,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:36:18,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:36:18,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:36:18,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:36:18,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:36:18,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:36:18,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:36:18,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:36:18,653 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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-25 10:36:18,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:36:18,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:36:18,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:36:18,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:36:18,952 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:36:18,953 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-25 10:36:20,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:36:20,446 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:36:20,446 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_5.c [2024-09-25 10:36:20,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/9098cbc5b/de3a60d211974c2ea3e41759d5588b77/FLAG6a40243d2 [2024-09-25 10:36:20,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/9098cbc5b/de3a60d211974c2ea3e41759d5588b77 [2024-09-25 10:36:20,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:36:20,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:36:20,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:36:20,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:36:20,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:36:20,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@654238f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20, skipping insertion in model container [2024-09-25 10:36:20,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:36:20,616 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-25 10:36:20,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:36:20,637 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:36:20,648 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-25 10:36:20,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:36:20,662 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:36:20,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20 WrapperNode [2024-09-25 10:36:20,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:36:20,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:36:20,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:36:20,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:36:20,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,680 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:36:20,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:36:20,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:36:20,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:36:20,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:36:20,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,701 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-25 10:36:20,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:36:20,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:36:20,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:36:20,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:36:20,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (1/1) ... [2024-09-25 10:36:20,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:36:20,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:20,758 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-25 10:36:20,765 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-25 10:36:20,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:36:20,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:36:20,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:36:20,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:36:20,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:36:20,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:36:20,801 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:36:20,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:36:20,855 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:36:20,857 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:36:20,981 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-25 10:36:20,981 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:36:21,011 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:36:21,011 INFO L317 CfgBuilder]: Removed 5 assume(true) statements. [2024-09-25 10:36:21,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:36:21 BoogieIcfgContainer [2024-09-25 10:36:21,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:36:21,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:36:21,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:36:21,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:36:21,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:36:20" (1/3) ... [2024-09-25 10:36:21,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a067275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:36:21, skipping insertion in model container [2024-09-25 10:36:21,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:20" (2/3) ... [2024-09-25 10:36:21,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a067275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:36:21, skipping insertion in model container [2024-09-25 10:36:21,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:36:21" (3/3) ... [2024-09-25 10:36:21,017 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_5.c [2024-09-25 10:36:21,031 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:36:21,031 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:36:21,092 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:36:21,099 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;@11fba4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:36:21,099 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:36:21,104 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-25 10:36:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-25 10:36:21,110 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:21,111 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:21,111 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:21,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,118 INFO L85 PathProgramCache]: Analyzing trace with hash 424554851, now seen corresponding path program 1 times [2024-09-25 10:36:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:21,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667758491] [2024-09-25 10:36:21,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:21,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,253 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,267 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-25 10:36:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667758491] [2024-09-25 10:36:21,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667758491] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:21,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:21,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:36:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001509452] [2024-09-25 10:36:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:21,277 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:36:21,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:21,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:36:21,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:36:21,300 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-25 10:36:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:21,327 INFO L93 Difference]: Finished difference Result 37 states and 57 transitions. [2024-09-25 10:36:21,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:36:21,329 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-25 10:36:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:21,334 INFO L225 Difference]: With dead ends: 37 [2024-09-25 10:36:21,334 INFO L226 Difference]: Without dead ends: 17 [2024-09-25 10:36:21,337 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-25 10:36:21,339 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-25 10:36:21,340 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-25 10:36:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-25 10:36:21,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-25 10:36:21,363 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-25 10:36:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-09-25 10:36:21,365 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2024-09-25 10:36:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:21,365 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-09-25 10:36:21,365 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-25 10:36:21,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-09-25 10:36:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-25 10:36:21,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:21,367 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:21,367 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:36:21,367 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:21,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,368 INFO L85 PathProgramCache]: Analyzing trace with hash 424502957, now seen corresponding path program 1 times [2024-09-25 10:36:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:21,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353505733] [2024-09-25 10:36:21,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,426 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-25 10:36:21,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:21,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353505733] [2024-09-25 10:36:21,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353505733] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:21,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:21,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:36:21,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064872939] [2024-09-25 10:36:21,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:21,433 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:36:21,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:21,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:36:21,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:21,434 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-25 10:36:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:21,451 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-09-25 10:36:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:36:21,451 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-25 10:36:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:21,452 INFO L225 Difference]: With dead ends: 29 [2024-09-25 10:36:21,452 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 10:36:21,452 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-25 10:36:21,453 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-25 10:36:21,454 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-25 10:36:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 10:36:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2024-09-25 10:36:21,458 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-25 10:36:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-09-25 10:36:21,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2024-09-25 10:36:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:21,459 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-09-25 10:36:21,459 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-25 10:36:21,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-09-25 10:36:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:36:21,460 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:21,460 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:21,460 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:36:21,460 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:21,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1994759058, now seen corresponding path program 1 times [2024-09-25 10:36:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347799016] [2024-09-25 10:36:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,539 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-25 10:36:21,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347799016] [2024-09-25 10:36:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347799016] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:21,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:21,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:36:21,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839096670] [2024-09-25 10:36:21,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:21,545 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:36:21,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:21,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:36:21,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:21,545 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-25 10:36:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:21,588 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-09-25 10:36:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:36:21,589 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-25 10:36:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:21,590 INFO L225 Difference]: With dead ends: 37 [2024-09-25 10:36:21,590 INFO L226 Difference]: Without dead ends: 25 [2024-09-25 10:36:21,590 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-25 10:36:21,592 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-25 10:36:21,594 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-25 10:36:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-25 10:36:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2024-09-25 10:36:21,597 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-25 10:36:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-09-25 10:36:21,600 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2024-09-25 10:36:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:21,600 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-09-25 10:36:21,601 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-25 10:36:21,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-09-25 10:36:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:36:21,604 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:21,604 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:21,604 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:36:21,604 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:21,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,605 INFO L85 PathProgramCache]: Analyzing trace with hash -667291207, now seen corresponding path program 1 times [2024-09-25 10:36:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:21,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862203770] [2024-09-25 10:36:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,672 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-25 10:36:21,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:21,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862203770] [2024-09-25 10:36:21,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862203770] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:21,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:21,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:36:21,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889538853] [2024-09-25 10:36:21,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:21,674 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:36:21,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:21,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:36:21,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:21,674 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-25 10:36:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:21,691 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2024-09-25 10:36:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:36:21,692 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-25 10:36:21,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:21,693 INFO L225 Difference]: With dead ends: 37 [2024-09-25 10:36:21,693 INFO L226 Difference]: Without dead ends: 24 [2024-09-25 10:36:21,693 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-25 10:36:21,694 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-25 10:36:21,694 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-25 10:36:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-25 10:36:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-09-25 10:36:21,701 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-25 10:36:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-09-25 10:36:21,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2024-09-25 10:36:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:21,703 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-09-25 10:36:21,703 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-25 10:36:21,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-09-25 10:36:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:36:21,703 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:21,704 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:21,704 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:36:21,704 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:21,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash -73398794, now seen corresponding path program 1 times [2024-09-25 10:36:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:21,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935932362] [2024-09-25 10:36:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:21,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,754 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-25 10:36:21,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:21,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935932362] [2024-09-25 10:36:21,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935932362] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:21,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:21,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:36:21,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543810552] [2024-09-25 10:36:21,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:21,755 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:36:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:21,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:36:21,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:21,756 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-25 10:36:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:21,776 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-09-25 10:36:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:36:21,776 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-25 10:36:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:21,777 INFO L225 Difference]: With dead ends: 37 [2024-09-25 10:36:21,777 INFO L226 Difference]: Without dead ends: 23 [2024-09-25 10:36:21,777 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-25 10:36:21,778 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-25 10:36:21,778 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-25 10:36:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-25 10:36:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-09-25 10:36:21,783 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-25 10:36:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-25 10:36:21,784 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 17 [2024-09-25 10:36:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:21,784 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-25 10:36:21,784 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-25 10:36:21,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-25 10:36:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:36:21,785 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:21,785 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-25 10:36:21,785 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:36:21,785 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:21,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1923600117, now seen corresponding path program 1 times [2024-09-25 10:36:21,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:21,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785442962] [2024-09-25 10:36:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:21,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,833 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-25 10:36:21,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:21,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785442962] [2024-09-25 10:36:21,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785442962] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:21,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:21,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:36:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887435815] [2024-09-25 10:36:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:21,847 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:36:21,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:21,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:36:21,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:21,848 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-25 10:36:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:21,862 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-09-25 10:36:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:36:21,863 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-25 10:36:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:21,863 INFO L225 Difference]: With dead ends: 37 [2024-09-25 10:36:21,865 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:36:21,865 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-25 10:36:21,867 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-25 10:36:21,867 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-25 10:36:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:36:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 10:36:21,873 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-25 10:36:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-09-25 10:36:21,874 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20 [2024-09-25 10:36:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:21,875 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-09-25 10:36:21,875 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-25 10:36:21,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-09-25 10:36:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:36:21,876 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:21,876 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-25 10:36:21,876 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:36:21,876 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:21,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,876 INFO L85 PathProgramCache]: Analyzing trace with hash 406923681, now seen corresponding path program 1 times [2024-09-25 10:36:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:21,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400604085] [2024-09-25 10:36:21,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:21,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,918 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,926 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-25 10:36:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400604085] [2024-09-25 10:36:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400604085] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877047004] [2024-09-25 10:36:21,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:21,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:21,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:21,932 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-25 10:36:21,934 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-25 10:36:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-25 10:36:21,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:22,015 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-25 10:36:22,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:22,063 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-25 10:36:22,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877047004] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:22,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:22,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:36:22,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419274970] [2024-09-25 10:36:22,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:22,064 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:36:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:22,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:36:22,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:36:22,067 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-25 10:36:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:22,091 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-09-25 10:36:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:36:22,096 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-25 10:36:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:22,097 INFO L225 Difference]: With dead ends: 41 [2024-09-25 10:36:22,097 INFO L226 Difference]: Without dead ends: 25 [2024-09-25 10:36:22,098 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-25 10:36:22,098 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-25 10:36:22,098 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-25 10:36:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-25 10:36:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-25 10:36:22,101 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-25 10:36:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-25 10:36:22,102 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 21 [2024-09-25 10:36:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:22,102 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-25 10:36:22,102 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-25 10:36:22,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-25 10:36:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 10:36:22,103 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:22,103 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-25 10:36:22,120 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:36:22,309 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-25 10:36:22,310 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:22,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:22,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1149298187, now seen corresponding path program 2 times [2024-09-25 10:36:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316189559] [2024-09-25 10:36:22,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:22,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:22,347 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-25 10:36:22,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316189559] [2024-09-25 10:36:22,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316189559] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587181200] [2024-09-25 10:36:22,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:36:22,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:22,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:22,350 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-25 10:36:22,351 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-25 10:36:22,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:36:22,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:22,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:36:22,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:22,452 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-25 10:36:22,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:22,511 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-25 10:36:22,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587181200] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:22,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:22,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-25 10:36:22,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772670685] [2024-09-25 10:36:22,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:22,515 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:36:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:22,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:36:22,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:36:22,516 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-25 10:36:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:22,693 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-09-25 10:36:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-25 10:36:22,693 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-25 10:36:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:22,694 INFO L225 Difference]: With dead ends: 63 [2024-09-25 10:36:22,694 INFO L226 Difference]: Without dead ends: 44 [2024-09-25 10:36:22,695 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-25 10:36:22,695 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-25 10:36:22,695 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-25 10:36:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-25 10:36:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-09-25 10:36:22,699 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-25 10:36:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-09-25 10:36:22,700 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2024-09-25 10:36:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:22,700 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-09-25 10:36:22,700 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-25 10:36:22,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-09-25 10:36:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-25 10:36:22,701 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:22,701 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-25 10:36:22,714 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:36:22,904 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-25 10:36:22,905 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:22,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1491254058, now seen corresponding path program 3 times [2024-09-25 10:36:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:22,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431738599] [2024-09-25 10:36:22,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:22,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:22,950 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-25 10:36:22,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:22,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431738599] [2024-09-25 10:36:22,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431738599] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:22,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693766660] [2024-09-25 10:36:22,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:36:22,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:22,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:22,953 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-25 10:36:22,954 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-25 10:36:22,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-25 10:36:22,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:22,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-25 10:36:22,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:23,035 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-25 10:36:23,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:23,087 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-25 10:36:23,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693766660] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:23,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:23,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-09-25 10:36:23,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504186556] [2024-09-25 10:36:23,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:23,088 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:36:23,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:23,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:36:23,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:36:23,089 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-25 10:36:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:23,196 INFO L93 Difference]: Finished difference Result 311 states and 367 transitions. [2024-09-25 10:36:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 10:36:23,197 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-25 10:36:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:23,199 INFO L225 Difference]: With dead ends: 311 [2024-09-25 10:36:23,199 INFO L226 Difference]: Without dead ends: 281 [2024-09-25 10:36:23,200 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-25 10:36:23,200 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.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:23,201 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.0s Time] [2024-09-25 10:36:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-09-25 10:36:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 201. [2024-09-25 10:36:23,235 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-25 10:36:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2024-09-25 10:36:23,239 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 35 [2024-09-25 10:36:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:23,240 INFO L474 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2024-09-25 10:36:23,240 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-25 10:36:23,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2024-09-25 10:36:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-09-25 10:36:23,249 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:23,249 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-25 10:36:23,261 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:36:23,449 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-25 10:36:23,450 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:23,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1947569315, now seen corresponding path program 4 times [2024-09-25 10:36:23,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:23,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133223342] [2024-09-25 10:36:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:23,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:23,652 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-25 10:36:23,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:23,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133223342] [2024-09-25 10:36:23,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133223342] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:23,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729054515] [2024-09-25 10:36:23,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:36:23,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:23,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:23,659 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-25 10:36:23,665 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-25 10:36:23,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:36:23,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:23,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:36:23,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:23,863 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-25 10:36:23,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:23,916 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-25 10:36:23,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729054515] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:23,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:23,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-09-25 10:36:23,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806348287] [2024-09-25 10:36:23,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:23,918 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:36:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:23,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:36:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:36:23,919 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-25 10:36:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:24,197 INFO L93 Difference]: Finished difference Result 1615 states and 1931 transitions. [2024-09-25 10:36:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-25 10:36:24,199 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-25 10:36:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:24,205 INFO L225 Difference]: With dead ends: 1615 [2024-09-25 10:36:24,206 INFO L226 Difference]: Without dead ends: 1421 [2024-09-25 10:36:24,207 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:36:24,208 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-25 10:36:24,208 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-25 10:36:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-09-25 10:36:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 957. [2024-09-25 10:36:24,338 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-25 10:36:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1081 transitions. [2024-09-25 10:36:24,350 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1081 transitions. Word has length 200 [2024-09-25 10:36:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:24,350 INFO L474 AbstractCegarLoop]: Abstraction has 957 states and 1081 transitions. [2024-09-25 10:36:24,350 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-25 10:36:24,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1081 transitions. [2024-09-25 10:36:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2024-09-25 10:36:24,383 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:24,383 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-25 10:36:24,397 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:36:24,584 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-25 10:36:24,584 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:24,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:24,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1117550867, now seen corresponding path program 5 times [2024-09-25 10:36:24,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:24,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074104134] [2024-09-25 10:36:24,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:24,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:25,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:25,541 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-25 10:36:25,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:25,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074104134] [2024-09-25 10:36:25,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074104134] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:25,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840771637] [2024-09-25 10:36:25,542 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:36:25,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:25,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:25,544 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-25 10:36:25,548 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-25 10:36:25,745 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2024-09-25 10:36:25,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:25,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:36:25,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:25,937 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-25 10:36:25,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:26,099 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-25 10:36:26,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840771637] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:26,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:26,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-25 10:36:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025551684] [2024-09-25 10:36:26,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:26,102 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:36:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:36:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:36:26,102 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-25 10:36:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:26,435 INFO L93 Difference]: Finished difference Result 3616 states and 4105 transitions. [2024-09-25 10:36:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:36:26,436 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-25 10:36:26,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:26,448 INFO L225 Difference]: With dead ends: 3616 [2024-09-25 10:36:26,448 INFO L226 Difference]: Without dead ends: 2781 [2024-09-25 10:36:26,452 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-25 10:36:26,453 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-25 10:36:26,453 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-25 10:36:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2024-09-25 10:36:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2781. [2024-09-25 10:36:26,760 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-25 10:36:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3129 transitions. [2024-09-25 10:36:26,770 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3129 transitions. Word has length 956 [2024-09-25 10:36:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:26,771 INFO L474 AbstractCegarLoop]: Abstraction has 2781 states and 3129 transitions. [2024-09-25 10:36:26,771 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-25 10:36:26,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3129 transitions. [2024-09-25 10:36:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2781 [2024-09-25 10:36:26,882 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:26,883 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-25 10:36:26,896 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:36:27,083 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-25 10:36:27,084 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:27,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1702199533, now seen corresponding path program 6 times [2024-09-25 10:36:27,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:27,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819795752] [2024-09-25 10:36:27,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:27,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:30,023 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:30,117 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-25 10:36:30,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819795752] [2024-09-25 10:36:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819795752] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:30,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007072732] [2024-09-25 10:36:30,120 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:36:30,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:30,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:30,125 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-25 10:36:30,126 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-25 10:36:33,111 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 465 check-sat command(s) [2024-09-25 10:36:33,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:33,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 5411 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:36:33,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:33,878 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-25 10:36:33,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:34,548 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-25 10:36:34,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007072732] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:34,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-25 10:36:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890390878] [2024-09-25 10:36:34,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:34,555 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:36:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:34,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:36:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:36:34,556 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-25 10:36:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:35,235 INFO L93 Difference]: Finished difference Result 10385 states and 11698 transitions. [2024-09-25 10:36:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:36:35,236 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-25 10:36:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:35,266 INFO L225 Difference]: With dead ends: 10385 [2024-09-25 10:36:35,266 INFO L226 Difference]: Without dead ends: 8301 [2024-09-25 10:36:35,272 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-25 10:36:35,273 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-25 10:36:35,273 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-25 10:36:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8301 states. [2024-09-25 10:36:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8301 to 8301. [2024-09-25 10:36:36,210 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-25 10:36:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8301 states to 8301 states and 9337 transitions. [2024-09-25 10:36:36,239 INFO L78 Accepts]: Start accepts. Automaton has 8301 states and 9337 transitions. Word has length 2780 [2024-09-25 10:36:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:36,240 INFO L474 AbstractCegarLoop]: Abstraction has 8301 states and 9337 transitions. [2024-09-25 10:36:36,241 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-25 10:36:36,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 8301 states and 9337 transitions. [2024-09-25 10:36:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8301 [2024-09-25 10:36:36,546 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:36,547 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-25 10:36:36,570 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 10:36:36,748 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-25 10:36:36,748 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:36,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:36,750 INFO L85 PathProgramCache]: Analyzing trace with hash -245490195, now seen corresponding path program 7 times [2024-09-25 10:36:36,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:36,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127730011] [2024-09-25 10:36:36,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:11,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:11,809 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-25 10:37:11,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:11,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127730011] [2024-09-25 10:37:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127730011] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324841809] [2024-09-25 10:37:11,810 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:37:11,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:11,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:11,814 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-25 10:37:11,815 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-25 10:37:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:14,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 21809 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:37:14,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:21,427 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-25 10:37:21,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:28,001 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-25 10:37:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324841809] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:28,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:28,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-09-25 10:37:28,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981897816] [2024-09-25 10:37:28,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:28,009 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:37:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:28,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:37:28,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:37:28,010 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-25 10:37:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:28,844 INFO L93 Difference]: Finished difference Result 12450 states and 14005 transitions. [2024-09-25 10:37:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:37:28,844 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-25 10:37:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:28,896 INFO L225 Difference]: With dead ends: 12450 [2024-09-25 10:37:28,896 INFO L226 Difference]: Without dead ends: 12447 [2024-09-25 10:37:28,901 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-25 10:37:28,902 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-25 10:37:28,903 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-25 10:37:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12447 states. [2024-09-25 10:37:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12447 to 12447. [2024-09-25 10:37:29,743 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-25 10:37:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12447 states to 12447 states and 14001 transitions. [2024-09-25 10:37:29,773 INFO L78 Accepts]: Start accepts. Automaton has 12447 states and 14001 transitions. Word has length 8300 [2024-09-25 10:37:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:29,779 INFO L474 AbstractCegarLoop]: Abstraction has 12447 states and 14001 transitions. [2024-09-25 10:37:29,780 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-25 10:37:29,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12447 states and 14001 transitions. [2024-09-25 10:37:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12447 [2024-09-25 10:37:30,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:30,370 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-25 10:37:30,414 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 10:37:30,570 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-25 10:37:30,570 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:30,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash -837436019, now seen corresponding path program 8 times [2024-09-25 10:37:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277577388] [2024-09-25 10:37:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:38:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat