./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_6.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_6.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 e0e55420715ff80c27c9ff14eb8ac6a520210206e33b4fd081fea4bf1c2e05be --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:39:46,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:39:47,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:39:47,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:39:47,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:39:47,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:39:47,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:39:47,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:39:47,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:39:47,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:39:47,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:39:47,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:39:47,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:39:47,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:39:47,105 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:39:47,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:39:47,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:39:47,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:39:47,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:39:47,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:39:47,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:39:47,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:39:47,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:39:47,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:39:47,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:39:47,109 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:39:47,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:39:47,110 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:39:47,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:39:47,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:39:47,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:39:47,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:39:47,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:39:47,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:39:47,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:39:47,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:39:47,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:39:47,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:39:47,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:39:47,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:39:47,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:39:47,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:39:47,113 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 -> e0e55420715ff80c27c9ff14eb8ac6a520210206e33b4fd081fea4bf1c2e05be Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 15:39:47,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:39:47,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:39:47,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:39:47,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:39:47,366 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:39:47,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_6.c [2024-09-12 15:39:48,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:39:48,751 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:39:48,752 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_6.c [2024-09-12 15:39:48,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/21bdfe4e5/27c7271a514a4642bb104f202e990db5/FLAG301250ef1 [2024-09-12 15:39:49,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/21bdfe4e5/27c7271a514a4642bb104f202e990db5 [2024-09-12 15:39:49,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:39:49,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:39:49,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:39:49,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:39:49,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:39:49,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b1c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49, skipping insertion in model container [2024-09-12 15:39:49,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:39:49,290 WARN L247 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_6.c[959,972] [2024-09-12 15:39:49,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:39:49,304 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:39:49,319 WARN L247 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_6.c[959,972] [2024-09-12 15:39:49,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:39:49,335 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:39:49,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49 WrapperNode [2024-09-12 15:39:49,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:39:49,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:39:49,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:39:49,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:39:49,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,350 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:39:49,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:39:49,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:39:49,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:39:49,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:39:49,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,371 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-12 15:39:49,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:39:49,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:39:49,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:39:49,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:39:49,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (1/1) ... [2024-09-12 15:39:49,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:39:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:49,412 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-12 15:39:49,421 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-12 15:39:49,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:39:49,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:39:49,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:39:49,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:39:49,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:39:49,453 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:39:49,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:39:49,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:39:49,507 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:39:49,509 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:39:49,632 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-09-12 15:39:49,633 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:39:49,647 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:39:49,647 INFO L318 CfgBuilder]: Removed 6 assume(true) statements. [2024-09-12 15:39:49,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:39:49 BoogieIcfgContainer [2024-09-12 15:39:49,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:39:49,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:39:49,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:39:49,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:39:49,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:39:49" (1/3) ... [2024-09-12 15:39:49,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396bd5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:39:49, skipping insertion in model container [2024-09-12 15:39:49,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:49" (2/3) ... [2024-09-12 15:39:49,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396bd5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:39:49, skipping insertion in model container [2024-09-12 15:39:49,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:39:49" (3/3) ... [2024-09-12 15:39:49,653 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_6.c [2024-09-12 15:39:49,665 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:39:49,665 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:39:49,700 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:39:49,705 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;@1a1c6648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:39:49,705 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:39:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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-12 15:39:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 15:39:49,712 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:49,712 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:49,713 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:49,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2016834771, now seen corresponding path program 1 times [2024-09-12 15:39:49,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:49,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806596140] [2024-09-12 15:39:49,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:49,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:49,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:49,891 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-12 15:39:49,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:49,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806596140] [2024-09-12 15:39:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806596140] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:39:49,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:39:49,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:39:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658028196] [2024-09-12 15:39:49,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:39:49,905 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:39:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:49,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:39:49,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:49,925 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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 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-12 15:39:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:49,958 INFO L93 Difference]: Finished difference Result 52 states and 88 transitions. [2024-09-12 15:39:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:39:49,960 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-12 15:39:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:49,966 INFO L225 Difference]: With dead ends: 52 [2024-09-12 15:39:49,966 INFO L226 Difference]: Without dead ends: 30 [2024-09-12 15:39:49,968 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-12 15:39:49,972 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:49,972 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 42 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-12 15:39:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2024-09-12 15:39:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 16 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-12 15:39:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-09-12 15:39:50,004 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 8 [2024-09-12 15:39:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:50,005 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-09-12 15:39:50,005 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-12 15:39:50,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-09-12 15:39:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 15:39:50,006 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:50,008 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:50,008 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:39:50,008 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:50,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1227354490, now seen corresponding path program 1 times [2024-09-12 15:39:50,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:50,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980656843] [2024-09-12 15:39:50,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:50,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,091 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,104 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-12 15:39:50,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:50,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980656843] [2024-09-12 15:39:50,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980656843] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:39:50,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:39:50,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:39:50,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892181616] [2024-09-12 15:39:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:39:50,109 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:39:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:50,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:39:50,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:50,110 INFO L87 Difference]: Start difference. First operand 20 states and 25 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-12 15:39:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:50,144 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2024-09-12 15:39:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:39:50,145 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-12 15:39:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:50,146 INFO L225 Difference]: With dead ends: 43 [2024-09-12 15:39:50,146 INFO L226 Difference]: Without dead ends: 29 [2024-09-12 15:39:50,146 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-12 15:39:50,147 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 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-12 15:39:50,148 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-12 15:39:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2024-09-12 15:39:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 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-12 15:39:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-09-12 15:39:50,152 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 11 [2024-09-12 15:39:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:50,152 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-09-12 15:39:50,153 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-12 15:39:50,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-09-12 15:39:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 15:39:50,154 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:50,154 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:50,155 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 15:39:50,155 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:50,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,156 INFO L85 PathProgramCache]: Analyzing trace with hash 139424289, now seen corresponding path program 1 times [2024-09-12 15:39:50,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:50,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914140567] [2024-09-12 15:39:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:50,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,238 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-12 15:39:50,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:50,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914140567] [2024-09-12 15:39:50,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914140567] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:39:50,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:39:50,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:39:50,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648900508] [2024-09-12 15:39:50,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:39:50,239 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:39:50,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:39:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:50,241 INFO L87 Difference]: Start difference. First operand 21 states and 26 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-12 15:39:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:50,269 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-09-12 15:39:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:39:50,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 15:39:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:50,270 INFO L225 Difference]: With dead ends: 43 [2024-09-12 15:39:50,271 INFO L226 Difference]: Without dead ends: 28 [2024-09-12 15:39:50,271 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-12 15:39:50,272 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 36 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-12 15:39:50,272 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-12 15:39:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2024-09-12 15:39:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-12 15:39:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-09-12 15:39:50,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 14 [2024-09-12 15:39:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:50,277 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-09-12 15:39:50,277 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-12 15:39:50,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-09-12 15:39:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 15:39:50,278 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:50,278 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:50,278 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 15:39:50,279 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:50,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash 371784402, now seen corresponding path program 1 times [2024-09-12 15:39:50,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:50,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367536335] [2024-09-12 15:39:50,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:50,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,337 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-12 15:39:50,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367536335] [2024-09-12 15:39:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367536335] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:39:50,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:39:50,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:39:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606462666] [2024-09-12 15:39:50,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:39:50,338 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:39:50,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:50,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:39:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:50,340 INFO L87 Difference]: Start difference. First operand 22 states and 27 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-12 15:39:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:50,355 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2024-09-12 15:39:50,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:39:50,356 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-12 15:39:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:50,356 INFO L225 Difference]: With dead ends: 43 [2024-09-12 15:39:50,357 INFO L226 Difference]: Without dead ends: 27 [2024-09-12 15:39:50,357 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-12 15:39:50,358 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 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-12 15:39:50,358 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-12 15:39:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-09-12 15:39:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-12 15:39:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-09-12 15:39:50,362 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 17 [2024-09-12 15:39:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:50,363 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-09-12 15:39:50,363 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-12 15:39:50,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-09-12 15:39:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 15:39:50,364 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:50,364 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-12 15:39:50,364 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 15:39:50,364 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:50,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1468430149, now seen corresponding path program 1 times [2024-09-12 15:39:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532138493] [2024-09-12 15:39:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,416 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-12 15:39:50,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:50,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532138493] [2024-09-12 15:39:50,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532138493] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:39:50,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:39:50,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:39:50,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718532358] [2024-09-12 15:39:50,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:39:50,417 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:39:50,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:39:50,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:50,418 INFO L87 Difference]: Start difference. First operand 23 states and 28 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-12 15:39:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:50,431 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2024-09-12 15:39:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:39:50,431 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-12 15:39:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:50,432 INFO L225 Difference]: With dead ends: 43 [2024-09-12 15:39:50,432 INFO L226 Difference]: Without dead ends: 26 [2024-09-12 15:39:50,432 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-12 15:39:50,433 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 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-12 15:39:50,433 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-12 15:39:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-12 15:39:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 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-12 15:39:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-09-12 15:39:50,436 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2024-09-12 15:39:50,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:50,437 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-09-12 15:39:50,437 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-12 15:39:50,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-09-12 15:39:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 15:39:50,438 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:50,438 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, 1, 1] [2024-09-12 15:39:50,438 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 15:39:50,438 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:50,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,439 INFO L85 PathProgramCache]: Analyzing trace with hash 880229710, now seen corresponding path program 1 times [2024-09-12 15:39:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:50,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803587931] [2024-09-12 15:39:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:50,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:50,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803587931] [2024-09-12 15:39:50,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803587931] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:39:50,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:39:50,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:39:50,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010033755] [2024-09-12 15:39:50,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:39:50,494 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:39:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:50,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:39:50,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:50,497 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-12 15:39:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:50,510 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-09-12 15:39:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:39:50,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2024-09-12 15:39:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:50,513 INFO L225 Difference]: With dead ends: 43 [2024-09-12 15:39:50,513 INFO L226 Difference]: Without dead ends: 25 [2024-09-12 15:39:50,513 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-12 15:39:50,514 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 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-12 15:39:50,514 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-12 15:39:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-12 15:39:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-12 15:39:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-09-12 15:39:50,521 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2024-09-12 15:39:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:50,521 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-09-12 15:39:50,524 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-12 15:39:50,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-09-12 15:39:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 15:39:50,525 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:50,525 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, 1, 1, 1] [2024-09-12 15:39:50,525 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 15:39:50,525 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:50,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1487910188, now seen corresponding path program 1 times [2024-09-12 15:39:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:50,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675538361] [2024-09-12 15:39:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:50,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675538361] [2024-09-12 15:39:50,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675538361] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:50,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452872700] [2024-09-12 15:39:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:50,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:50,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:50,582 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-12 15:39:50,583 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-12 15:39:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 15:39:50,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:50,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:50,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452872700] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:50,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:50,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 15:39:50,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829074461] [2024-09-12 15:39:50,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:50,674 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:39:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:50,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:39:50,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:39:50,676 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-12 15:39:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:50,704 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2024-09-12 15:39:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:39:50,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-12 15:39:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:50,705 INFO L225 Difference]: With dead ends: 47 [2024-09-12 15:39:50,705 INFO L226 Difference]: Without dead ends: 28 [2024-09-12 15:39:50,706 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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-12 15:39:50,706 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:50,706 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-12 15:39:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-12 15:39:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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-12 15:39:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-09-12 15:39:50,714 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 24 [2024-09-12 15:39:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:50,714 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-09-12 15:39:50,714 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-12 15:39:50,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-09-12 15:39:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 15:39:50,717 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:50,717 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, 1, 1, 1] [2024-09-12 15:39:50,730 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 15:39:50,917 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-12 15:39:50,918 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:50,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:50,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1161476914, now seen corresponding path program 2 times [2024-09-12 15:39:50,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:50,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198377112] [2024-09-12 15:39:50,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-12 15:39:50,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198377112] [2024-09-12 15:39:50,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198377112] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100986008] [2024-09-12 15:39:50,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 15:39:50,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:50,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:50,955 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-12 15:39:50,959 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-12 15:39:50,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 15:39:50,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:39:50,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 15:39:50,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:51,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:51,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100986008] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:51,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:51,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-12 15:39:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86217014] [2024-09-12 15:39:51,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:51,063 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 15:39:51,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 15:39:51,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:39:51,064 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-12 15:39:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:51,173 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-09-12 15:39:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 15:39:51,173 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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 27 [2024-09-12 15:39:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:51,174 INFO L225 Difference]: With dead ends: 69 [2024-09-12 15:39:51,174 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 15:39:51,174 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-12 15:39:51,175 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:51,175 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:51,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 15:39:51,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2024-09-12 15:39:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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-12 15:39:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-09-12 15:39:51,179 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 27 [2024-09-12 15:39:51,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:51,180 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-09-12 15:39:51,180 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-12 15:39:51,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:51,180 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-09-12 15:39:51,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-12 15:39:51,181 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:51,181 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, 1, 1, 1] [2024-09-12 15:39:51,196 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 15:39:51,381 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-12 15:39:51,382 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:51,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1903306395, now seen corresponding path program 3 times [2024-09-12 15:39:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524142113] [2024-09-12 15:39:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:51,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:51,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-12 15:39:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524142113] [2024-09-12 15:39:51,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524142113] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755508254] [2024-09-12 15:39:51,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 15:39:51,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:51,430 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-12 15:39:51,436 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-12 15:39:51,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-12 15:39:51,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:39:51,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 15:39:51,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-09-12 15:39:51,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-09-12 15:39:51,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755508254] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:51,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-09-12 15:39:51,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678860026] [2024-09-12 15:39:51,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:51,581 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 15:39:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:51,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 15:39:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-12 15:39:51,583 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-12 15:39:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:51,720 INFO L93 Difference]: Finished difference Result 326 states and 387 transitions. [2024-09-12 15:39:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 15:39:51,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 38 [2024-09-12 15:39:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:51,722 INFO L225 Difference]: With dead ends: 326 [2024-09-12 15:39:51,723 INFO L226 Difference]: Without dead ends: 293 [2024-09-12 15:39:51,723 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 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-12 15:39:51,723 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 82 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 81 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-12 15:39:51,724 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 81 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-09-12 15:39:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 213. [2024-09-12 15:39:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.1770334928229664) internal successors, (246), 209 states have internal predecessors, (246), 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-12 15:39:51,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2024-09-12 15:39:51,766 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 38 [2024-09-12 15:39:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:51,767 INFO L474 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2024-09-12 15:39:51,767 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-12 15:39:51,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2024-09-12 15:39:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-09-12 15:39:51,772 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:51,773 INFO L216 NwaCegarLoop]: trace histogram [96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:51,787 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 15:39:51,975 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-12 15:39:51,975 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:51,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash 460573421, now seen corresponding path program 4 times [2024-09-12 15:39:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:51,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778089106] [2024-09-12 15:39:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:51,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:52,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6790 backedges. 2573 proven. 1 refuted. 0 times theorem prover too weak. 4216 trivial. 0 not checked. [2024-09-12 15:39:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:52,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778089106] [2024-09-12 15:39:52,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778089106] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:52,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490859235] [2024-09-12 15:39:52,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 15:39:52,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:52,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:52,207 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-12 15:39:52,209 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-12 15:39:52,307 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 15:39:52,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:39:52,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 15:39:52,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6790 backedges. 1492 proven. 53 refuted. 0 times theorem prover too weak. 5245 trivial. 0 not checked. [2024-09-12 15:39:52,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6790 backedges. 1492 proven. 53 refuted. 0 times theorem prover too weak. 5245 trivial. 0 not checked. [2024-09-12 15:39:52,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490859235] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:52,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:52,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-09-12 15:39:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229773800] [2024-09-12 15:39:52,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:52,410 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 15:39:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 15:39:52,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:39:52,411 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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-12 15:39:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:52,678 INFO L93 Difference]: Finished difference Result 1639 states and 1963 transitions. [2024-09-12 15:39:52,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 15:39:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 212 [2024-09-12 15:39:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:52,684 INFO L225 Difference]: With dead ends: 1639 [2024-09-12 15:39:52,684 INFO L226 Difference]: Without dead ends: 1433 [2024-09-12 15:39:52,687 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 421 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-12 15:39:52,688 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:52,690 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-09-12 15:39:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 969. [2024-09-12 15:39:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.133678756476684) internal successors, (1094), 965 states have internal predecessors, (1094), 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-12 15:39:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1097 transitions. [2024-09-12 15:39:52,810 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1097 transitions. Word has length 212 [2024-09-12 15:39:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:52,810 INFO L474 AbstractCegarLoop]: Abstraction has 969 states and 1097 transitions. [2024-09-12 15:39:52,810 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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-12 15:39:52,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1097 transitions. [2024-09-12 15:39:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2024-09-12 15:39:52,826 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:52,826 INFO L216 NwaCegarLoop]: trace histogram [576, 96, 96, 96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:52,839 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 15:39:53,030 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-12 15:39:53,031 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:53,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:53,031 INFO L85 PathProgramCache]: Analyzing trace with hash -805971587, now seen corresponding path program 5 times [2024-09-12 15:39:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:53,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925990133] [2024-09-12 15:39:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:53,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:53,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 236772 backedges. 88966 proven. 1 refuted. 0 times theorem prover too weak. 147805 trivial. 0 not checked. [2024-09-12 15:39:53,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925990133] [2024-09-12 15:39:53,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925990133] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171527353] [2024-09-12 15:39:53,603 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 15:39:53,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:53,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:53,604 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-12 15:39:53,605 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-12 15:39:53,788 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2024-09-12 15:39:53,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:39:53,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 15:39:53,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 236772 backedges. 126024 proven. 1853 refuted. 0 times theorem prover too weak. 108895 trivial. 0 not checked. [2024-09-12 15:39:53,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 236772 backedges. 126024 proven. 1853 refuted. 0 times theorem prover too weak. 108895 trivial. 0 not checked. [2024-09-12 15:39:54,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171527353] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:54,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:54,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-09-12 15:39:54,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667827233] [2024-09-12 15:39:54,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:54,131 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 15:39:54,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:54,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 15:39:54,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:39:54,132 INFO L87 Difference]: Start difference. First operand 969 states and 1097 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-12 15:39:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:54,982 INFO L93 Difference]: Finished difference Result 9295 states and 10571 transitions. [2024-09-12 15:39:54,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 15:39:54,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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 968 [2024-09-12 15:39:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:55,004 INFO L225 Difference]: With dead ends: 9295 [2024-09-12 15:39:55,005 INFO L226 Difference]: Without dead ends: 8333 [2024-09-12 15:39:55,035 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1953 GetRequests, 1933 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-12 15:39:55,035 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 84 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:55,036 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 80 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8333 states. [2024-09-12 15:39:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8333 to 5565. [2024-09-12 15:39:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5565 states, 5561 states have (on average 1.1260564646646287) internal successors, (6262), 5561 states have internal predecessors, (6262), 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-12 15:39:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5565 states to 5565 states and 6265 transitions. [2024-09-12 15:39:55,481 INFO L78 Accepts]: Start accepts. Automaton has 5565 states and 6265 transitions. Word has length 968 [2024-09-12 15:39:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:55,481 INFO L474 AbstractCegarLoop]: Abstraction has 5565 states and 6265 transitions. [2024-09-12 15:39:55,481 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-12 15:39:55,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5565 states and 6265 transitions. [2024-09-12 15:39:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5565 [2024-09-12 15:39:55,856 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:55,858 INFO L216 NwaCegarLoop]: trace histogram [3456, 576, 576, 576, 96, 96, 96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:55,870 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 15:39:56,058 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-12 15:39:56,069 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:56,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:56,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1133091731, now seen corresponding path program 6 times [2024-09-12 15:39:56,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:56,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727073749] [2024-09-12 15:39:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:56,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:04,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:40:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8528834 backedges. 1866278 proven. 66653 refuted. 0 times theorem prover too weak. 6595903 trivial. 0 not checked. [2024-09-12 15:40:04,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:40:04,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727073749] [2024-09-12 15:40:04,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727073749] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:40:04,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835114741] [2024-09-12 15:40:04,711 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 15:40:04,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:40:04,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:40:04,715 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-12 15:40:04,722 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-12 15:40:07,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 467 check-sat command(s) [2024-09-12 15:40:07,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:40:07,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 5203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 15:40:07,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:40:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8528834 backedges. 1866288 proven. 66653 refuted. 0 times theorem prover too weak. 6595893 trivial. 0 not checked. [2024-09-12 15:40:08,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:40:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8528834 backedges. 1866288 proven. 66653 refuted. 0 times theorem prover too weak. 6595893 trivial. 0 not checked. [2024-09-12 15:40:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835114741] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:40:09,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:40:09,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-12 15:40:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224980010] [2024-09-12 15:40:09,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:40:09,536 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 15:40:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:40:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 15:40:09,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:40:09,537 INFO L87 Difference]: Start difference. First operand 5565 states and 6265 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-12 15:40:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:40:10,830 INFO L93 Difference]: Finished difference Result 21472 states and 24193 transitions. [2024-09-12 15:40:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:40:10,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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 5564 [2024-09-12 15:40:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:40:10,882 INFO L225 Difference]: With dead ends: 21472 [2024-09-12 15:40:10,882 INFO L226 Difference]: Without dead ends: 16605 [2024-09-12 15:40:10,890 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11134 GetRequests, 11127 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-12 15:40:10,891 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:40:10,891 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:40:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16605 states. [2024-09-12 15:40:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16605 to 16605. [2024-09-12 15:40:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16605 states, 16601 states have (on average 1.125112945003313) internal successors, (18678), 16601 states have internal predecessors, (18678), 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-12 15:40:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16605 states to 16605 states and 18681 transitions. [2024-09-12 15:40:12,458 INFO L78 Accepts]: Start accepts. Automaton has 16605 states and 18681 transitions. Word has length 5564 [2024-09-12 15:40:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:40:12,461 INFO L474 AbstractCegarLoop]: Abstraction has 16605 states and 18681 transitions. [2024-09-12 15:40:12,461 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-12 15:40:12,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 16605 states and 18681 transitions. [2024-09-12 15:40:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16605 [2024-09-12 15:40:14,037 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:40:14,040 INFO L216 NwaCegarLoop]: trace histogram [10368, 1728, 1728, 1728, 288, 288, 288, 48, 48, 48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:40:14,059 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 15:40:14,244 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-12 15:40:14,245 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:40:14,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:14,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1779349907, now seen corresponding path program 7 times [2024-09-12 15:40:14,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:40:14,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872627164] [2024-09-12 15:40:14,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:14,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:40:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat