./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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-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 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 12:15:50,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:15:50,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:15:50,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:15:50,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:15:50,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:15:50,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:15:50,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:15:50,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:15:50,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:15:50,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:15:50,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:15:50,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:15:50,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:15:50,307 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:15:50,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:15:50,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:15:50,309 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:15:50,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:15:50,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:15:50,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:15:50,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:15:50,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:15:50,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:15:50,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:15:50,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:15:50,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:15:50,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:15:50,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:15:50,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:15:50,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:15:50,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:15:50,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:15:50,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:15:50,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:15:50,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:15:50,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:15:50,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:15:50,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:15:50,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:15:50,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:15:50,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:15:50,317 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 12:15:50,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:15:50,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:15:50,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:15:50,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:15:50,609 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:15:50,610 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-20 12:15:52,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:15:52,306 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:15:52,307 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_6.c [2024-09-20 12:15:52,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/56e9c4bcb/09e2da9ba1ac4a9293de4d21d814b314/FLAG7fab4a274 [2024-09-20 12:15:52,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/56e9c4bcb/09e2da9ba1ac4a9293de4d21d814b314 [2024-09-20 12:15:52,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:15:52,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:15:52,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:15:52,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:15:52,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:15:52,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f8ca3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52, skipping insertion in model container [2024-09-20 12:15:52,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:15:52,518 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_6.c[959,972] [2024-09-20 12:15:52,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:15:52,534 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:15:52,554 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_6.c[959,972] [2024-09-20 12:15:52,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:15:52,584 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:15:52,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52 WrapperNode [2024-09-20 12:15:52,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:15:52,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:15:52,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:15:52,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:15:52,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,608 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:15:52,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:15:52,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:15:52,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:15:52,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:15:52,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,649 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-20 12:15:52,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:15:52,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:15:52,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:15:52,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:15:52,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (1/1) ... [2024-09-20 12:15:52,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:15:52,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:52,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 12:15:52,705 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 12:15:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:15:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:15:52,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:15:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:15:52,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:15:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:15:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:15:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:15:52,819 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:15:52,822 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:15:52,987 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-09-20 12:15:52,988 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:15:53,015 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:15:53,015 INFO L318 CfgBuilder]: Removed 6 assume(true) statements. [2024-09-20 12:15:53,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:15:53 BoogieIcfgContainer [2024-09-20 12:15:53,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:15:53,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:15:53,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:15:53,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:15:53,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:15:52" (1/3) ... [2024-09-20 12:15:53,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@885b226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:15:53, skipping insertion in model container [2024-09-20 12:15:53,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:52" (2/3) ... [2024-09-20 12:15:53,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@885b226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:15:53, skipping insertion in model container [2024-09-20 12:15:53,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:15:53" (3/3) ... [2024-09-20 12:15:53,026 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_6.c [2024-09-20 12:15:53,042 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:15:53,042 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:15:53,089 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:15:53,095 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;@23a99132, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:15:53,096 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:15:53,099 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-20 12:15:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-20 12:15:53,105 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:53,105 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:53,106 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:53,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2016834771, now seen corresponding path program 1 times [2024-09-20 12:15:53,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:53,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568113169] [2024-09-20 12:15:53,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:53,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:53,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:53,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568113169] [2024-09-20 12:15:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568113169] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:53,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398618472] [2024-09-20 12:15:53,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:53,326 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:53,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:53,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:53,354 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-20 12:15:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:53,422 INFO L93 Difference]: Finished difference Result 52 states and 88 transitions. [2024-09-20 12:15:53,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:53,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-20 12:15:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:53,432 INFO L225 Difference]: With dead ends: 52 [2024-09-20 12:15:53,432 INFO L226 Difference]: Without dead ends: 30 [2024-09-20 12:15:53,435 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:53,438 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-20 12:15:53,439 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-20 12:15:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-20 12:15:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2024-09-20 12:15:53,464 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-20 12:15:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-09-20 12:15:53,467 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 8 [2024-09-20 12:15:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:53,468 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-09-20 12:15:53,468 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:15:53,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-09-20 12:15:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 12:15:53,470 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:53,470 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:53,470 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:15:53,470 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:53,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1227354490, now seen corresponding path program 1 times [2024-09-20 12:15:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:53,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252794695] [2024-09-20 12:15:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:53,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:53,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:53,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252794695] [2024-09-20 12:15:53,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252794695] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:53,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:53,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:53,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364543893] [2024-09-20 12:15:53,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:53,603 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:53,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:53,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:53,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:53,608 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-20 12:15:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:53,648 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2024-09-20 12:15:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-20 12:15:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:53,650 INFO L225 Difference]: With dead ends: 43 [2024-09-20 12:15:53,651 INFO L226 Difference]: Without dead ends: 29 [2024-09-20 12:15:53,652 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:53,653 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-20 12:15:53,654 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-20 12:15:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-20 12:15:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2024-09-20 12:15:53,662 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-20 12:15:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-09-20 12:15:53,664 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 11 [2024-09-20 12:15:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:53,664 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-09-20 12:15:53,665 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:15:53,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-09-20 12:15:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-20 12:15:53,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:53,667 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:53,668 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:15:53,668 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:53,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,669 INFO L85 PathProgramCache]: Analyzing trace with hash 139424289, now seen corresponding path program 1 times [2024-09-20 12:15:53,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:53,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381485520] [2024-09-20 12:15:53,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:53,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:53,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:53,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381485520] [2024-09-20 12:15:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381485520] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:53,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:53,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977115707] [2024-09-20 12:15:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:53,748 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:53,749 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-20 12:15:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:53,780 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-09-20 12:15:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:53,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-20 12:15:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:53,784 INFO L225 Difference]: With dead ends: 43 [2024-09-20 12:15:53,784 INFO L226 Difference]: Without dead ends: 28 [2024-09-20 12:15:53,785 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:53,786 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-20 12:15:53,786 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-20 12:15:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-20 12:15:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2024-09-20 12:15:53,792 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-20 12:15:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-09-20 12:15:53,794 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 14 [2024-09-20 12:15:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:53,795 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-09-20 12:15:53,795 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:15:53,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-09-20 12:15:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-20 12:15:53,799 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:53,799 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:53,799 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 12:15:53,800 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:53,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash 371784402, now seen corresponding path program 1 times [2024-09-20 12:15:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243133486] [2024-09-20 12:15:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,868 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:53,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243133486] [2024-09-20 12:15:53,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243133486] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:53,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:53,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340289755] [2024-09-20 12:15:53,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:53,883 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:53,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:53,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:53,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:53,884 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-20 12:15:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:53,914 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2024-09-20 12:15:53,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:53,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-20 12:15:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:53,915 INFO L225 Difference]: With dead ends: 43 [2024-09-20 12:15:53,916 INFO L226 Difference]: Without dead ends: 27 [2024-09-20 12:15:53,916 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:53,917 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-20 12:15:53,918 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-20 12:15:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-20 12:15:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-09-20 12:15:53,922 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-20 12:15:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-09-20 12:15:53,923 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 17 [2024-09-20 12:15:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:53,923 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-09-20 12:15:53,923 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:15:53,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-09-20 12:15:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-20 12:15:53,925 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:53,925 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:53,925 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 12:15:53,925 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:53,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1468430149, now seen corresponding path program 1 times [2024-09-20 12:15:53,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:53,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031192811] [2024-09-20 12:15:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:53,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:53,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:53,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031192811] [2024-09-20 12:15:53,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031192811] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:53,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:54,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:54,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180198822] [2024-09-20 12:15:54,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:54,000 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:54,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:54,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:54,001 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-20 12:15:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:54,019 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2024-09-20 12:15:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:54,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-20 12:15:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:54,020 INFO L225 Difference]: With dead ends: 43 [2024-09-20 12:15:54,020 INFO L226 Difference]: Without dead ends: 26 [2024-09-20 12:15:54,021 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:54,022 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-20 12:15:54,022 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-20 12:15:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-20 12:15:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-20 12:15:54,026 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-20 12:15:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-09-20 12:15:54,026 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2024-09-20 12:15:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:54,027 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-09-20 12:15:54,027 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:15:54,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-09-20 12:15:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-20 12:15:54,028 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:54,028 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-20 12:15:54,028 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 12:15:54,028 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:54,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash 880229710, now seen corresponding path program 1 times [2024-09-20 12:15:54,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:54,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701375188] [2024-09-20 12:15:54,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:54,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:54,101 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-20 12:15:54,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:54,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701375188] [2024-09-20 12:15:54,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701375188] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:54,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:54,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:54,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909239083] [2024-09-20 12:15:54,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:54,107 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:54,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:54,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:54,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:54,110 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-20 12:15:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:54,127 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-09-20 12:15:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:54,127 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-20 12:15:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:54,128 INFO L225 Difference]: With dead ends: 43 [2024-09-20 12:15:54,128 INFO L226 Difference]: Without dead ends: 25 [2024-09-20 12:15:54,129 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:54,129 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-20 12:15:54,130 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-20 12:15:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-20 12:15:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-20 12:15:54,139 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-20 12:15:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-09-20 12:15:54,140 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2024-09-20 12:15:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:54,142 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-09-20 12:15:54,142 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-20 12:15:54,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-09-20 12:15:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-20 12:15:54,143 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:54,143 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-20 12:15:54,143 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 12:15:54,144 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:54,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:54,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1487910188, now seen corresponding path program 1 times [2024-09-20 12:15:54,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:54,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195630907] [2024-09-20 12:15:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:54,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:54,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:54,215 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-20 12:15:54,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:54,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195630907] [2024-09-20 12:15:54,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195630907] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:15:54,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495495934] [2024-09-20 12:15:54,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:54,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:54,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 12:15:54,221 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 12:15:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:54,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-20 12:15:54,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:15:54,328 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-20 12:15:54,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:15:54,365 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-20 12:15:54,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495495934] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:15:54,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:15:54,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-20 12:15:54,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451180835] [2024-09-20 12:15:54,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:15:54,367 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 12:15:54,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:54,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 12:15:54,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:15:54,368 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-20 12:15:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:54,398 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2024-09-20 12:15:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:15:54,399 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-20 12:15:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:54,402 INFO L225 Difference]: With dead ends: 47 [2024-09-20 12:15:54,402 INFO L226 Difference]: Without dead ends: 28 [2024-09-20 12:15:54,403 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-20 12:15:54,403 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-20 12:15:54,404 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-20 12:15:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-20 12:15:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-20 12:15:54,408 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-20 12:15:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-09-20 12:15:54,409 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 24 [2024-09-20 12:15:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:54,409 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-09-20 12:15:54,409 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-20 12:15:54,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-09-20 12:15:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-20 12:15:54,410 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:54,410 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-20 12:15:54,424 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-20 12:15:54,611 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-20 12:15:54,611 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:54,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:54,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1161476914, now seen corresponding path program 2 times [2024-09-20 12:15:54,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:54,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671225933] [2024-09-20 12:15:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:54,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:54,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:54,690 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-20 12:15:54,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:54,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671225933] [2024-09-20 12:15:54,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671225933] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:15:54,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262260990] [2024-09-20 12:15:54,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 12:15:54,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:54,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:54,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 12:15:54,694 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-20 12:15:54,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 12:15:54,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:15:54,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 12:15:54,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:15:54,802 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-20 12:15:54,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:15:54,869 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-20 12:15:54,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262260990] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:15:54,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:15:54,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-20 12:15:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323825191] [2024-09-20 12:15:54,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:15:54,873 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 12:15:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:54,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 12:15:54,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-20 12:15:54,876 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-20 12:15:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:55,035 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-09-20 12:15:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-20 12:15:55,036 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-20 12:15:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:55,037 INFO L225 Difference]: With dead ends: 69 [2024-09-20 12:15:55,037 INFO L226 Difference]: Without dead ends: 47 [2024-09-20 12:15:55,038 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-20 12:15:55,038 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-20 12:15:55,039 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-20 12:15:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-20 12:15:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2024-09-20 12:15:55,044 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-20 12:15:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-09-20 12:15:55,045 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 27 [2024-09-20 12:15:55,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:55,046 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-09-20 12:15:55,046 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-20 12:15:55,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-09-20 12:15:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-20 12:15:55,047 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:55,047 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-20 12:15:55,065 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-20 12:15:55,254 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:55,255 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:55,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:55,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1903306395, now seen corresponding path program 3 times [2024-09-20 12:15:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665819014] [2024-09-20 12:15:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:55,367 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:55,373 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-20 12:15:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:55,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665819014] [2024-09-20 12:15:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665819014] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:15:55,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825234827] [2024-09-20 12:15:55,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 12:15:55,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:55,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:55,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 12:15:55,379 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-20 12:15:55,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-20 12:15:55,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:15:55,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-20 12:15:55,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:15:55,498 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-20 12:15:55,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:15:55,567 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-20 12:15:55,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825234827] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:15:55,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:15:55,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-09-20 12:15:55,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277412222] [2024-09-20 12:15:55,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:15:55,570 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 12:15:55,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:55,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 12:15:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-20 12:15:55,572 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-20 12:15:55,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:55,720 INFO L93 Difference]: Finished difference Result 326 states and 387 transitions. [2024-09-20 12:15:55,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 12:15:55,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-20 12:15:55,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:55,723 INFO L225 Difference]: With dead ends: 326 [2024-09-20 12:15:55,723 INFO L226 Difference]: Without dead ends: 293 [2024-09-20 12:15:55,724 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-20 12:15:55,724 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-20 12:15:55,725 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-20 12:15:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-09-20 12:15:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 213. [2024-09-20 12:15:55,760 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-20 12:15:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2024-09-20 12:15:55,763 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 38 [2024-09-20 12:15:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:55,763 INFO L474 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2024-09-20 12:15:55,763 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-20 12:15:55,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2024-09-20 12:15:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-09-20 12:15:55,770 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:55,771 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-20 12:15:55,786 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 12:15:55,971 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-20 12:15:55,972 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:55,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash 460573421, now seen corresponding path program 4 times [2024-09-20 12:15:55,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:55,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405121986] [2024-09-20 12:15:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:55,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:56,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:56,211 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-20 12:15:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:56,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405121986] [2024-09-20 12:15:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405121986] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:15:56,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900940415] [2024-09-20 12:15:56,212 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 12:15:56,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:56,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:56,214 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 12:15:56,215 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-20 12:15:56,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 12:15:56,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:15:56,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:15:56,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:15:56,441 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-20 12:15:56,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:15:56,518 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-20 12:15:56,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900940415] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:15:56,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:15:56,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-09-20 12:15:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252579705] [2024-09-20 12:15:56,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:15:56,522 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 12:15:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:56,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 12:15:56,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-20 12:15:56,524 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-20 12:15:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:56,905 INFO L93 Difference]: Finished difference Result 1639 states and 1963 transitions. [2024-09-20 12:15:56,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-20 12:15:56,906 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-20 12:15:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:56,912 INFO L225 Difference]: With dead ends: 1639 [2024-09-20 12:15:56,912 INFO L226 Difference]: Without dead ends: 1433 [2024-09-20 12:15:56,914 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-20 12:15:56,915 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.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:15:56,915 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.1s Time] [2024-09-20 12:15:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-09-20 12:15:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 969. [2024-09-20 12:15:57,077 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-20 12:15:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1097 transitions. [2024-09-20 12:15:57,083 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1097 transitions. Word has length 212 [2024-09-20 12:15:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:57,084 INFO L474 AbstractCegarLoop]: Abstraction has 969 states and 1097 transitions. [2024-09-20 12:15:57,084 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-20 12:15:57,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1097 transitions. [2024-09-20 12:15:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2024-09-20 12:15:57,107 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:57,107 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-20 12:15:57,126 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 12:15:57,308 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:57,309 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:57,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash -805971587, now seen corresponding path program 5 times [2024-09-20 12:15:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102783099] [2024-09-20 12:15:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:57,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:58,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:58,087 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-20 12:15:58,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:58,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102783099] [2024-09-20 12:15:58,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102783099] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:15:58,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65870886] [2024-09-20 12:15:58,088 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-20 12:15:58,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:58,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:58,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 12:15:58,091 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-20 12:15:58,379 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2024-09-20 12:15:58,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:15:58,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:15:58,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:15:58,602 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-20 12:15:58,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:15:58,798 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-20 12:15:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65870886] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:15:58,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:15:58,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-09-20 12:15:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434608147] [2024-09-20 12:15:58,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:15:58,801 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 12:15:58,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:58,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 12:15:58,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-20 12:15:58,802 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-20 12:15:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:59,873 INFO L93 Difference]: Finished difference Result 9295 states and 10571 transitions. [2024-09-20 12:15:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-20 12:15:59,874 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-20 12:15:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:59,911 INFO L225 Difference]: With dead ends: 9295 [2024-09-20 12:15:59,912 INFO L226 Difference]: Without dead ends: 8333 [2024-09-20 12:15:59,920 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-20 12:15:59,921 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-20 12:15:59,921 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-20 12:15:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8333 states. [2024-09-20 12:16:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8333 to 5565. [2024-09-20 12:16:00,687 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-20 12:16:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5565 states to 5565 states and 6265 transitions. [2024-09-20 12:16:00,724 INFO L78 Accepts]: Start accepts. Automaton has 5565 states and 6265 transitions. Word has length 968 [2024-09-20 12:16:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:16:00,727 INFO L474 AbstractCegarLoop]: Abstraction has 5565 states and 6265 transitions. [2024-09-20 12:16:00,727 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-20 12:16:00,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:16:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 5565 states and 6265 transitions. [2024-09-20 12:16:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5565 [2024-09-20 12:16:00,985 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:16:00,987 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-20 12:16:01,002 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-20 12:16:01,188 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-20 12:16:01,188 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:16:01,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:16:01,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1133091731, now seen corresponding path program 6 times [2024-09-20 12:16:01,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:16:01,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495657124] [2024-09-20 12:16:01,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:16:01,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:16:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:16:11,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:16:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:16:11,993 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-20 12:16:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:16:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495657124] [2024-09-20 12:16:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495657124] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:16:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066212135] [2024-09-20 12:16:11,994 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-20 12:16:11,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:16:11,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:16:11,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 12:16:11,997 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-20 12:16:15,037 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 467 check-sat command(s) [2024-09-20 12:16:15,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:16:15,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 5203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:16:15,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:16:16,270 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-20 12:16:16,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:16:17,215 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-20 12:16:17,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066212135] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:16:17,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:16:17,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-20 12:16:17,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628375560] [2024-09-20 12:16:17,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:16:17,222 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 12:16:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:16:17,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 12:16:17,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:16:17,223 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-20 12:16:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:16:18,971 INFO L93 Difference]: Finished difference Result 21472 states and 24193 transitions. [2024-09-20 12:16:18,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 12:16:18,972 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-20 12:16:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:16:19,053 INFO L225 Difference]: With dead ends: 21472 [2024-09-20 12:16:19,053 INFO L226 Difference]: Without dead ends: 16605 [2024-09-20 12:16:19,068 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-20 12:16:19,069 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-20 12:16:19,070 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-20 12:16:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16605 states. [2024-09-20 12:16:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16605 to 16605. [2024-09-20 12:16:20,773 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-20 12:16:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16605 states to 16605 states and 18681 transitions. [2024-09-20 12:16:20,845 INFO L78 Accepts]: Start accepts. Automaton has 16605 states and 18681 transitions. Word has length 5564 [2024-09-20 12:16:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:16:20,847 INFO L474 AbstractCegarLoop]: Abstraction has 16605 states and 18681 transitions. [2024-09-20 12:16:20,848 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-20 12:16:20,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:16:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16605 states and 18681 transitions. [2024-09-20 12:16:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16605 [2024-09-20 12:16:22,159 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:16:22,163 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-20 12:16:22,183 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-20 12:16:22,363 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-20 12:16:22,364 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:16:22,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:16:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1779349907, now seen corresponding path program 7 times [2024-09-20 12:16:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:16:22,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795641416] [2024-09-20 12:16:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:16:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:16:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat