./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.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 1ae3736aabcb020d122100864e41791456e1f94490735ab1a93eef5c54883fe7 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 21:43:05,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 21:43:05,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 21:43:05,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 21:43:05,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 21:43:05,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 21:43:05,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 21:43:05,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 21:43:05,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 21:43:05,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 21:43:05,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 21:43:05,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 21:43:05,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 21:43:05,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 21:43:05,540 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 21:43:05,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 21:43:05,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 21:43:05,541 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 21:43:05,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 21:43:05,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 21:43:05,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 21:43:05,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 21:43:05,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 21:43:05,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 21:43:05,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 21:43:05,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 21:43:05,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 21:43:05,544 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 21:43:05,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 21:43:05,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 21:43:05,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 21:43:05,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 21:43:05,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:43:05,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 21:43:05,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 21:43:05,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 21:43:05,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 21:43:05,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 21:43:05,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 21:43:05,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 21:43:05,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 21:43:05,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 21:43:05,547 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 -> 1ae3736aabcb020d122100864e41791456e1f94490735ab1a93eef5c54883fe7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 21:43:05,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 21:43:05,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 21:43:05,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 21:43:05,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 21:43:05,765 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 21:43:05,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2024-09-12 21:43:06,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 21:43:07,120 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 21:43:07,121 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2024-09-12 21:43:07,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/eef944f11/cacfa2f4695a4bd48df5033102208111/FLAGf9a95987f [2024-09-12 21:43:07,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/eef944f11/cacfa2f4695a4bd48df5033102208111 [2024-09-12 21:43:07,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 21:43:07,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 21:43:07,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 21:43:07,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 21:43:07,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 21:43:07,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c758bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07, skipping insertion in model container [2024-09-12 21:43:07,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 21:43:07,287 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2024-09-12 21:43:07,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:43:07,315 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 21:43:07,329 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2024-09-12 21:43:07,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:43:07,344 INFO L204 MainTranslator]: Completed translation [2024-09-12 21:43:07,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07 WrapperNode [2024-09-12 21:43:07,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 21:43:07,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 21:43:07,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 21:43:07,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 21:43:07,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,362 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 21:43:07,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 21:43:07,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 21:43:07,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 21:43:07,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 21:43:07,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,383 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 21:43:07,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 21:43:07,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 21:43:07,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 21:43:07,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 21:43:07,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (1/1) ... [2024-09-12 21:43:07,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:43:07,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:07,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 21:43:07,442 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 21:43:07,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 21:43:07,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 21:43:07,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 21:43:07,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 21:43:07,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 21:43:07,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 21:43:07,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 21:43:07,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 21:43:07,529 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 21:43:07,531 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 21:43:07,663 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-09-12 21:43:07,664 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 21:43:07,678 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 21:43:07,678 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 21:43:07,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:43:07 BoogieIcfgContainer [2024-09-12 21:43:07,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 21:43:07,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 21:43:07,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 21:43:07,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 21:43:07,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 09:43:07" (1/3) ... [2024-09-12 21:43:07,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1ecbda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:43:07, skipping insertion in model container [2024-09-12 21:43:07,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:07" (2/3) ... [2024-09-12 21:43:07,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1ecbda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:43:07, skipping insertion in model container [2024-09-12 21:43:07,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:43:07" (3/3) ... [2024-09-12 21:43:07,688 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2024-09-12 21:43:07,701 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 21:43:07,701 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 21:43:07,755 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 21:43:07,760 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;@7e6bf5e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 21:43:07,761 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 21:43:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 21:43:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 21:43:07,774 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:07,775 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, 1, 1] [2024-09-12 21:43:07,775 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:07,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash -547593777, now seen corresponding path program 1 times [2024-09-12 21:43:07,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:07,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912590595] [2024-09-12 21:43:07,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:08,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:08,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:08,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912590595] [2024-09-12 21:43:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912590595] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:08,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:08,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 21:43:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830318047] [2024-09-12 21:43:08,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:08,017 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 21:43:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:08,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 21:43:08,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 21:43:08,035 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 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 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:08,222 INFO L93 Difference]: Finished difference Result 75 states and 129 transitions. [2024-09-12 21:43:08,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 21:43:08,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 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) Word has length 26 [2024-09-12 21:43:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:08,230 INFO L225 Difference]: With dead ends: 75 [2024-09-12 21:43:08,230 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 21:43:08,232 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:43:08,236 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 73 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:08,237 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 11 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 21:43:08,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-12 21:43:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-09-12 21:43:08,267 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 26 [2024-09-12 21:43:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:08,267 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-09-12 21:43:08,267 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:08,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-09-12 21:43:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 21:43:08,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:08,269 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, 1, 1] [2024-09-12 21:43:08,269 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 21:43:08,269 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:08,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:08,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1435031967, now seen corresponding path program 1 times [2024-09-12 21:43:08,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:08,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782791583] [2024-09-12 21:43:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:08,413 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:08,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:08,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782791583] [2024-09-12 21:43:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782791583] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:08,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:43:08,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783227672] [2024-09-12 21:43:08,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:08,423 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:43:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:08,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:43:08,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:43:08,424 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:08,522 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2024-09-12 21:43:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:43:08,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 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) Word has length 26 [2024-09-12 21:43:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:08,523 INFO L225 Difference]: With dead ends: 61 [2024-09-12 21:43:08,524 INFO L226 Difference]: Without dead ends: 40 [2024-09-12 21:43:08,524 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:43:08,525 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:08,526 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-12 21:43:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-12 21:43:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-12 21:43:08,534 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 26 [2024-09-12 21:43:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:08,535 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-12 21:43:08,535 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:08,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-12 21:43:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 21:43:08,537 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:08,537 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, 1, 1] [2024-09-12 21:43:08,537 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 21:43:08,537 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:08,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash -658634253, now seen corresponding path program 1 times [2024-09-12 21:43:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864467221] [2024-09-12 21:43:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:08,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:08,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:08,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864467221] [2024-09-12 21:43:08,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864467221] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:08,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:08,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 21:43:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992760148] [2024-09-12 21:43:08,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:08,659 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 21:43:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 21:43:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:43:08,660 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:08,759 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-09-12 21:43:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:43:08,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 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) Word has length 26 [2024-09-12 21:43:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:08,760 INFO L225 Difference]: With dead ends: 51 [2024-09-12 21:43:08,761 INFO L226 Difference]: Without dead ends: 36 [2024-09-12 21:43:08,761 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2024-09-12 21:43:08,762 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:08,762 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-12 21:43:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-09-12 21:43:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-09-12 21:43:08,768 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 26 [2024-09-12 21:43:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:08,768 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-09-12 21:43:08,768 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:08,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-09-12 21:43:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 21:43:08,769 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:08,770 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, 1, 1] [2024-09-12 21:43:08,770 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 21:43:08,770 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:08,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:08,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2104520742, now seen corresponding path program 1 times [2024-09-12 21:43:08,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:08,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865266482] [2024-09-12 21:43:08,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:08,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:08,905 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:08,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865266482] [2024-09-12 21:43:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865266482] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:08,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:08,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-12 21:43:08,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448393870] [2024-09-12 21:43:08,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:08,912 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 21:43:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:08,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 21:43:08,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:43:08,913 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:09,041 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-09-12 21:43:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 21:43:09,041 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 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) Word has length 26 [2024-09-12 21:43:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:09,042 INFO L225 Difference]: With dead ends: 41 [2024-09-12 21:43:09,042 INFO L226 Difference]: Without dead ends: 30 [2024-09-12 21:43:09,045 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2024-09-12 21:43:09,046 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:09,046 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-12 21:43:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-12 21:43:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-12 21:43:09,054 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 26 [2024-09-12 21:43:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:09,054 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-12 21:43:09,054 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-12 21:43:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 21:43:09,056 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:09,056 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, 1, 1] [2024-09-12 21:43:09,056 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 21:43:09,056 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:09,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1273709334, now seen corresponding path program 1 times [2024-09-12 21:43:09,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:09,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959456460] [2024-09-12 21:43:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:09,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:09,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:09,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:09,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959456460] [2024-09-12 21:43:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959456460] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:09,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 21:43:09,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417267780] [2024-09-12 21:43:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:09,096 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 21:43:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:09,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 21:43:09,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 21:43:09,097 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:09,146 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-09-12 21:43:09,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 21:43:09,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 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) Word has length 26 [2024-09-12 21:43:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:09,148 INFO L225 Difference]: With dead ends: 33 [2024-09-12 21:43:09,149 INFO L226 Difference]: Without dead ends: 30 [2024-09-12 21:43:09,150 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:43:09,150 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:09,151 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 7 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:43:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-12 21:43:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-12 21:43:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-09-12 21:43:09,156 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2024-09-12 21:43:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:09,156 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-09-12 21:43:09,156 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-09-12 21:43:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 21:43:09,157 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:09,157 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, 1, 1] [2024-09-12 21:43:09,157 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 21:43:09,157 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:09,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:09,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1274275363, now seen corresponding path program 1 times [2024-09-12 21:43:09,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:09,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146432529] [2024-09-12 21:43:09,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:09,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:09,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:09,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:09,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146432529] [2024-09-12 21:43:09,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146432529] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:09,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:09,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-12 21:43:09,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439079787] [2024-09-12 21:43:09,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:09,271 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 21:43:09,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:09,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 21:43:09,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-09-12 21:43:09,272 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:09,401 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-09-12 21:43:09,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 21:43:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 1 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) Word has length 26 [2024-09-12 21:43:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:09,402 INFO L225 Difference]: With dead ends: 35 [2024-09-12 21:43:09,402 INFO L226 Difference]: Without dead ends: 30 [2024-09-12 21:43:09,402 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2024-09-12 21:43:09,403 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:09,403 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-12 21:43:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-12 21:43:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-09-12 21:43:09,407 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2024-09-12 21:43:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:09,407 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-09-12 21:43:09,407 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-09-12 21:43:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 21:43:09,408 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:09,408 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, 1, 1, 1, 1] [2024-09-12 21:43:09,408 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 21:43:09,408 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:09,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:09,409 INFO L85 PathProgramCache]: Analyzing trace with hash -38547728, now seen corresponding path program 1 times [2024-09-12 21:43:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826016660] [2024-09-12 21:43:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:09,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826016660] [2024-09-12 21:43:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826016660] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:09,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:09,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-09-12 21:43:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147205592] [2024-09-12 21:43:09,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:09,517 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 21:43:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:09,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 21:43:09,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-09-12 21:43:09,518 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:09,649 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-09-12 21:43:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 21:43:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 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) Word has length 28 [2024-09-12 21:43:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:09,650 INFO L225 Difference]: With dead ends: 37 [2024-09-12 21:43:09,650 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 21:43:09,651 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2024-09-12 21:43:09,652 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:09,652 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:43:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 21:43:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 21:43:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-09-12 21:43:09,661 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2024-09-12 21:43:09,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:09,663 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-09-12 21:43:09,663 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:09,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-09-12 21:43:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 21:43:09,664 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:09,664 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:09,664 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 21:43:09,664 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:09,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1516913261, now seen corresponding path program 1 times [2024-09-12 21:43:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:09,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609386658] [2024-09-12 21:43:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:09,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:09,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609386658] [2024-09-12 21:43:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609386658] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696092539] [2024-09-12 21:43:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:09,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:09,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:09,787 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 21:43:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:09,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 21:43:09,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:09,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:10,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696092539] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:10,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:10,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2024-09-12 21:43:10,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049304310] [2024-09-12 21:43:10,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:10,109 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-12 21:43:10,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:10,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-12 21:43:10,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2024-09-12 21:43:10,110 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:10,442 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2024-09-12 21:43:10,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 21:43:10,443 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-09-12 21:43:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:10,443 INFO L225 Difference]: With dead ends: 61 [2024-09-12 21:43:10,443 INFO L226 Difference]: Without dead ends: 56 [2024-09-12 21:43:10,444 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2024-09-12 21:43:10,445 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 68 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:10,446 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 19 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-12 21:43:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-09-12 21:43:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-09-12 21:43:10,454 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 30 [2024-09-12 21:43:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:10,455 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-09-12 21:43:10,455 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:10,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-09-12 21:43:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 21:43:10,457 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:10,457 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:10,472 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 21:43:10,659 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:10,660 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:10,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash 522084041, now seen corresponding path program 2 times [2024-09-12 21:43:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:10,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749776492] [2024-09-12 21:43:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:11,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:11,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:11,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749776492] [2024-09-12 21:43:11,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749776492] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:11,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219011073] [2024-09-12 21:43:11,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 21:43:11,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:11,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:11,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:11,033 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 21:43:11,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 21:43:11,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:11,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-12 21:43:11,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:11,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219011073] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:11,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:11,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2024-09-12 21:43:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569776167] [2024-09-12 21:43:11,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:11,755 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-09-12 21:43:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-09-12 21:43:11,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2024-09-12 21:43:11,757 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:12,684 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2024-09-12 21:43:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-12 21:43:12,685 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-09-12 21:43:12,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:12,686 INFO L225 Difference]: With dead ends: 109 [2024-09-12 21:43:12,686 INFO L226 Difference]: Without dead ends: 104 [2024-09-12 21:43:12,690 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3433, Invalid=5687, Unknown=0, NotChecked=0, Total=9120 [2024-09-12 21:43:12,691 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 117 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:12,691 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 25 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-12 21:43:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-09-12 21:43:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2024-09-12 21:43:12,706 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 54 [2024-09-12 21:43:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:12,706 INFO L474 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2024-09-12 21:43:12,706 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:12,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2024-09-12 21:43:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-09-12 21:43:12,710 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:12,710 INFO L216 NwaCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:12,723 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 21:43:12,911 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:12,911 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:12,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:12,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1063675007, now seen corresponding path program 3 times [2024-09-12 21:43:12,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:12,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279512646] [2024-09-12 21:43:12,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:12,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:13,911 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279512646] [2024-09-12 21:43:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279512646] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177091328] [2024-09-12 21:43:13,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 21:43:13,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:13,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:13,917 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:13,917 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 21:43:13,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-12 21:43:13,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:13,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 21:43:13,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2024-09-12 21:43:14,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2024-09-12 21:43:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177091328] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:14,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:14,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 4, 4] total 54 [2024-09-12 21:43:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838636928] [2024-09-12 21:43:14,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:14,083 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-09-12 21:43:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:14,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-09-12 21:43:14,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2024-09-12 21:43:14,085 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 54 states, 54 states have (on average 2.388888888888889) internal successors, (129), 53 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:15,121 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2024-09-12 21:43:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-12 21:43:15,121 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.388888888888889) internal successors, (129), 53 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-09-12 21:43:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:15,122 INFO L225 Difference]: With dead ends: 116 [2024-09-12 21:43:15,122 INFO L226 Difference]: Without dead ends: 111 [2024-09-12 21:43:15,124 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2024-09-12 21:43:15,124 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 110 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:15,125 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 19 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-12 21:43:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-09-12 21:43:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2024-09-12 21:43:15,133 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 102 [2024-09-12 21:43:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:15,133 INFO L474 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2024-09-12 21:43:15,133 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.388888888888889) internal successors, (129), 53 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:15,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2024-09-12 21:43:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-09-12 21:43:15,134 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:15,135 INFO L216 NwaCegarLoop]: trace histogram [42, 38, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:15,147 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 21:43:15,335 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 21:43:15,335 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:15,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash 947022028, now seen corresponding path program 4 times [2024-09-12 21:43:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683172503] [2024-09-12 21:43:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:16,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 21:43:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:16,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683172503] [2024-09-12 21:43:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683172503] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:16,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247446661] [2024-09-12 21:43:16,453 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 21:43:16,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:16,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:16,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:16,457 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 21:43:16,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 21:43:16,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:16,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-12 21:43:16,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 21:43:16,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 21:43:17,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247446661] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:17,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:17,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 54 [2024-09-12 21:43:17,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538479446] [2024-09-12 21:43:17,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:17,447 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-09-12 21:43:17,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:17,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-09-12 21:43:17,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2024-09-12 21:43:17,449 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 54 states, 54 states have (on average 2.425925925925926) internal successors, (131), 53 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:18,444 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2024-09-12 21:43:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-12 21:43:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.425925925925926) internal successors, (131), 53 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-09-12 21:43:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:18,445 INFO L225 Difference]: With dead ends: 127 [2024-09-12 21:43:18,445 INFO L226 Difference]: Without dead ends: 117 [2024-09-12 21:43:18,447 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 173 SyntacticMatches, 46 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2635 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4031, Invalid=6681, Unknown=0, NotChecked=0, Total=10712 [2024-09-12 21:43:18,447 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:18,448 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 10 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-09-12 21:43:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-09-12 21:43:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2024-09-12 21:43:18,456 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 110 [2024-09-12 21:43:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:18,456 INFO L474 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2024-09-12 21:43:18,456 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.425925925925926) internal successors, (131), 53 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:18,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2024-09-12 21:43:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-09-12 21:43:18,461 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:18,461 INFO L216 NwaCegarLoop]: trace histogram [45, 41, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:18,474 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 21:43:18,662 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:18,662 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:18,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1278572995, now seen corresponding path program 5 times [2024-09-12 21:43:18,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:18,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021585550] [2024-09-12 21:43:18,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:19,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:19,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:19,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021585550] [2024-09-12 21:43:19,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021585550] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:19,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763664506] [2024-09-12 21:43:19,812 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 21:43:19,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:19,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:19,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:19,814 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 21:43:19,868 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2024-09-12 21:43:19,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:19,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-12 21:43:19,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 484 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2024-09-12 21:43:20,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 484 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2024-09-12 21:43:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763664506] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:21,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 25, 25] total 99 [2024-09-12 21:43:21,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659512043] [2024-09-12 21:43:21,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:21,489 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2024-09-12 21:43:21,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:21,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2024-09-12 21:43:21,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4755, Invalid=4947, Unknown=0, NotChecked=0, Total=9702 [2024-09-12 21:43:21,492 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 99 states, 99 states have (on average 2.2525252525252526) internal successors, (223), 98 states have internal predecessors, (223), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:24,355 INFO L93 Difference]: Finished difference Result 204 states and 246 transitions. [2024-09-12 21:43:24,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-09-12 21:43:24,356 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 99 states have (on average 2.2525252525252526) internal successors, (223), 98 states have internal predecessors, (223), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-09-12 21:43:24,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:24,357 INFO L225 Difference]: With dead ends: 204 [2024-09-12 21:43:24,357 INFO L226 Difference]: Without dead ends: 201 [2024-09-12 21:43:24,360 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4845 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=14259, Invalid=23571, Unknown=0, NotChecked=0, Total=37830 [2024-09-12 21:43:24,360 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 200 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:24,361 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 13 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:43:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-09-12 21:43:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-09-12 21:43:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.0101522842639594) internal successors, (199), 197 states have internal predecessors, (199), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2024-09-12 21:43:24,377 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 116 [2024-09-12 21:43:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:24,377 INFO L474 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2024-09-12 21:43:24,377 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 2.2525252525252526) internal successors, (223), 98 states have internal predecessors, (223), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:24,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2024-09-12 21:43:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-09-12 21:43:24,379 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:24,379 INFO L216 NwaCegarLoop]: trace histogram [87, 46, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:24,391 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 21:43:24,579 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-12 21:43:24,580 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:24,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash -169597305, now seen corresponding path program 6 times [2024-09-12 21:43:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:24,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989914421] [2024-09-12 21:43:24,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:27,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:27,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989914421] [2024-09-12 21:43:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989914421] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924197626] [2024-09-12 21:43:27,957 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 21:43:27,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:27,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:27,959 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:27,960 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 21:43:28,060 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 87 check-sat command(s) [2024-09-12 21:43:28,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:28,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-12 21:43:28,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3813 proven. 2116 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-09-12 21:43:28,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3813 proven. 2116 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-09-12 21:43:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924197626] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:30,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:30,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 49, 49] total 103 [2024-09-12 21:43:30,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130756046] [2024-09-12 21:43:30,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:30,014 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-09-12 21:43:30,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-09-12 21:43:30,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2024-09-12 21:43:30,016 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand has 103 states, 103 states have (on average 2.2135922330097086) internal successors, (228), 102 states have internal predecessors, (228), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:33,440 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2024-09-12 21:43:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-09-12 21:43:33,440 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.2135922330097086) internal successors, (228), 102 states have internal predecessors, (228), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 200 [2024-09-12 21:43:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:33,441 INFO L225 Difference]: With dead ends: 212 [2024-09-12 21:43:33,441 INFO L226 Difference]: Without dead ends: 209 [2024-09-12 21:43:33,444 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 404 SyntacticMatches, 44 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6125 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=15453, Invalid=25553, Unknown=0, NotChecked=0, Total=41006 [2024-09-12 21:43:33,444 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 207 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:33,444 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 19 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:43:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-09-12 21:43:33,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-09-12 21:43:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.0097560975609756) internal successors, (207), 205 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2024-09-12 21:43:33,454 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 200 [2024-09-12 21:43:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:33,455 INFO L474 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2024-09-12 21:43:33,455 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.2135922330097086) internal successors, (228), 102 states have internal predecessors, (228), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:33,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2024-09-12 21:43:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-09-12 21:43:33,456 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:33,456 INFO L216 NwaCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:33,472 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 21:43:33,662 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-12 21:43:33,663 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:33,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:33,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1018265071, now seen corresponding path program 7 times [2024-09-12 21:43:33,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:33,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302040733] [2024-09-12 21:43:33,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:35,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2024-09-12 21:43:35,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:35,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302040733] [2024-09-12 21:43:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302040733] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:35,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304098248] [2024-09-12 21:43:35,094 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-12 21:43:35,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:35,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:35,100 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:35,101 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 21:43:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:35,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-09-12 21:43:35,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2024-09-12 21:43:35,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2024-09-12 21:43:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304098248] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:35,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:35,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 56 [2024-09-12 21:43:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707708405] [2024-09-12 21:43:35,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:35,630 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-09-12 21:43:35,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:35,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-09-12 21:43:35,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2024-09-12 21:43:35,632 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand has 56 states, 56 states have (on average 2.267857142857143) internal successors, (127), 55 states have internal predecessors, (127), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:38,099 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2024-09-12 21:43:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-09-12 21:43:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.267857142857143) internal successors, (127), 55 states have internal predecessors, (127), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 208 [2024-09-12 21:43:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:38,101 INFO L225 Difference]: With dead ends: 215 [2024-09-12 21:43:38,102 INFO L226 Difference]: Without dead ends: 212 [2024-09-12 21:43:38,103 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 416 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=319, Invalid=11237, Unknown=0, NotChecked=0, Total=11556 [2024-09-12 21:43:38,103 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 129 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 6684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:38,103 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 163 Invalid, 6685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6684 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-09-12 21:43:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-09-12 21:43:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2024-09-12 21:43:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.0096618357487923) internal successors, (209), 207 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2024-09-12 21:43:38,116 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2024-09-12 21:43:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:38,116 INFO L474 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2024-09-12 21:43:38,117 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.267857142857143) internal successors, (127), 55 states have internal predecessors, (127), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:38,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:38,117 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2024-09-12 21:43:38,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-09-12 21:43:38,118 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:38,118 INFO L216 NwaCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:38,131 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 21:43:38,319 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:38,319 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:38,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash -707348599, now seen corresponding path program 8 times [2024-09-12 21:43:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:38,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668885565] [2024-09-12 21:43:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:39,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2024-09-12 21:43:39,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:39,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668885565] [2024-09-12 21:43:39,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668885565] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:39,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:39,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2024-09-12 21:43:39,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485741473] [2024-09-12 21:43:39,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:39,584 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-09-12 21:43:39,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:39,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-09-12 21:43:39,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2024-09-12 21:43:39,584 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand has 53 states, 53 states have (on average 2.3773584905660377) internal successors, (126), 52 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:40,286 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2024-09-12 21:43:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-12 21:43:40,286 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.3773584905660377) internal successors, (126), 52 states have internal predecessors, (126), 1 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) Word has length 210 [2024-09-12 21:43:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:40,286 INFO L225 Difference]: With dead ends: 211 [2024-09-12 21:43:40,286 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 21:43:40,288 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2024-09-12 21:43:40,289 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:40,289 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:43:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 21:43:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 21:43:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 21:43:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 21:43:40,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 210 [2024-09-12 21:43:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:40,289 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 21:43:40,289 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.3773584905660377) internal successors, (126), 52 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:40,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 21:43:40,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 21:43:40,292 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 21:43:40,292 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-12 21:43:40,294 INFO L408 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:40,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 21:43:42,394 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 21:43:42,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 09:43:42 BoogieIcfgContainer [2024-09-12 21:43:42,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 21:43:42,422 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 21:43:42,422 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 21:43:42,422 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 21:43:42,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:43:07" (3/4) ... [2024-09-12 21:43:42,424 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 21:43:42,427 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 21:43:42,428 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 21:43:42,431 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-09-12 21:43:42,432 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 21:43:42,432 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 21:43:42,432 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 21:43:42,450 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 1)) [2024-09-12 21:43:42,450 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((main__y == 50) && (main__x <= 2)) && (\old(__return_720) == __return_720)) [2024-09-12 21:43:42,450 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 3)) [2024-09-12 21:43:42,450 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((main__y == 50) && (main__x <= 4)) && (\old(__return_720) == __return_720)) [2024-09-12 21:43:42,450 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 5)) [2024-09-12 21:43:42,451 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 6)) [2024-09-12 21:43:42,451 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((main__x <= 7) && (main__y == 50)) && (\old(__return_720) == __return_720)) [2024-09-12 21:43:42,451 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((main__x <= 8) && (main__y == 50)) && (\old(__return_720) == __return_720)) [2024-09-12 21:43:42,451 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((((((((89 == main__y) && (89 == main__x)) && (\old(__return_720) == __return_720)) || (((53 == main__y) && (53 == main__x)) && (\old(__return_720) == __return_720))) || (((71 == main__y) && (\old(__return_720) == __return_720)) && (71 == main__x))) || (((79 == main__x) && (79 == main__y)) && (\old(__return_720) == __return_720))) || (((88 == main__y) && (\old(__return_720) == __return_720)) && (88 == main__x))) || (((81 == main__y) && (\old(__return_720) == __return_720)) && (81 == main__x))) || (((100 == main__y) && (100 <= main__x)) && (\old(__return_720) == __return_720))) || (((65 == main__y) && (\old(__return_720) == __return_720)) && (65 == main__x))) || (((main__y == 50) && (main__x <= 50)) && (\old(__return_720) == __return_720))) || (((52 == main__y) && (\old(__return_720) == __return_720)) && (52 == main__x))) || (((74 == main__x) && (\old(__return_720) == __return_720)) && (74 == main__y))) || (((64 == main__x) && (64 == main__y)) && (\old(__return_720) == __return_720))) || (((\old(__return_720) == __return_720) && (main__x == 93)) && (main__y == 93))) || (((\old(__return_720) == __return_720) && (main__x == 80)) && (main__y == 80))) || (((main__y == 86) && (\old(__return_720) == __return_720)) && (main__x == 86))) || (((main__x == 96) && (main__y == 96)) && (\old(__return_720) == __return_720))) || (((87 == main__x) && (\old(__return_720) == __return_720)) && (87 == main__y))) || (((90 == main__x) && (\old(__return_720) == __return_720)) && (90 == main__y))) || (((\old(__return_720) == __return_720) && (92 == main__y)) && (92 == main__x))) || (((60 == main__x) && (60 == main__y)) && (\old(__return_720) == __return_720))) || (((63 == main__x) && (63 == main__y)) && (\old(__return_720) == __return_720))) || (((98 == main__x) && (98 == main__y)) && (\old(__return_720) == __return_720))) || (((59 == main__y) && (\old(__return_720) == __return_720)) && (59 == main__x))) || (((72 == main__x) && (72 == main__y)) && (\old(__return_720) == __return_720))) || (((85 == main__y) && (\old(__return_720) == __return_720)) && (85 == main__x))) || (((73 == main__x) && (\old(__return_720) == __return_720)) && (73 == main__y))) || (((97 == main__x) && (\old(__return_720) == __return_720)) && (97 == main__y))) || (((main__x == 83) && (\old(__return_720) == __return_720)) && (main__y == 83))) || (((main__y == 54) && (main__x == 54)) && (\old(__return_720) == __return_720))) || (((91 == main__y) && (91 == main__x)) && (\old(__return_720) == __return_720))) || (((main__x == 61) && (main__y == 61)) && (\old(__return_720) == __return_720))) || (((58 == main__y) && (\old(__return_720) == __return_720)) && (58 == main__x))) || (((69 == main__y) && (\old(__return_720) == __return_720)) && (69 == main__x))) || (((95 == main__y) && (\old(__return_720) == __return_720)) && (95 == main__x))) || (((56 == main__x) && (\old(__return_720) == __return_720)) && (56 == main__y))) || (((55 == main__x) && (\old(__return_720) == __return_720)) && (55 == main__y))) || (((main__x == 75) && (main__y == 75)) && (\old(__return_720) == __return_720))) || (((68 == main__x) && (\old(__return_720) == __return_720)) && (68 == main__y))) || (((\old(__return_720) == __return_720) && (57 == main__x)) && (57 == main__y))) || (((51 == main__y) && (51 == main__x)) && (\old(__return_720) == __return_720))) || (((66 == main__y) && (66 == main__x)) && (\old(__return_720) == __return_720))) || (((main__y == 99) && (main__x == 99)) && (\old(__return_720) == __return_720))) || (((84 == main__x) && (\old(__return_720) == __return_720)) && (84 == main__y))) || (((67 == main__x) && (67 == main__y)) && (\old(__return_720) == __return_720))) || (((62 == main__x) && (62 == main__y)) && (\old(__return_720) == __return_720))) || (((70 == main__x) && (\old(__return_720) == __return_720)) && (70 == main__y))) || (((94 == main__y) && (94 == main__x)) && (\old(__return_720) == __return_720))) || (((76 == main__y) && (76 == main__x)) && (\old(__return_720) == __return_720))) || (((78 == main__y) && (\old(__return_720) == __return_720)) && (78 == main__x))) || (((82 == main__x) && (\old(__return_720) == __return_720)) && (82 == main__y))) || (((\old(__return_720) == __return_720) && (77 == main__x)) && (77 == main__y))) [2024-09-12 21:43:42,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 21:43:42,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 21:43:42,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 21:43:42,516 INFO L158 Benchmark]: Toolchain (without parser) took 35377.27ms. Allocated memory was 138.4MB in the beginning and 453.0MB in the end (delta: 314.6MB). Free memory was 68.0MB in the beginning and 345.6MB in the end (delta: -277.6MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-09-12 21:43:42,516 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:43:42,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.69ms. Allocated memory is still 138.4MB. Free memory was 67.9MB in the beginning and 55.1MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 21:43:42,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.82ms. Allocated memory is still 138.4MB. Free memory was 55.1MB in the beginning and 54.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:43:42,516 INFO L158 Benchmark]: Boogie Preprocessor took 30.27ms. Allocated memory is still 138.4MB. Free memory was 54.1MB in the beginning and 52.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 21:43:42,516 INFO L158 Benchmark]: RCFGBuilder took 284.86ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 52.1MB in the beginning and 142.8MB in the end (delta: -90.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-12 21:43:42,517 INFO L158 Benchmark]: TraceAbstraction took 34736.29ms. Allocated memory was 180.4MB in the beginning and 453.0MB in the end (delta: 272.6MB). Free memory was 141.8MB in the beginning and 350.8MB in the end (delta: -209.1MB). Peak memory consumption was 268.0MB. Max. memory is 16.1GB. [2024-09-12 21:43:42,517 INFO L158 Benchmark]: Witness Printer took 93.13ms. Allocated memory is still 453.0MB. Free memory was 350.8MB in the beginning and 345.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 21:43:42,520 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.69ms. Allocated memory is still 138.4MB. Free memory was 67.9MB in the beginning and 55.1MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.82ms. Allocated memory is still 138.4MB. Free memory was 55.1MB in the beginning and 54.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.27ms. Allocated memory is still 138.4MB. Free memory was 54.1MB in the beginning and 52.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 284.86ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 52.1MB in the beginning and 142.8MB in the end (delta: -90.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 34736.29ms. Allocated memory was 180.4MB in the beginning and 453.0MB in the end (delta: 272.6MB). Free memory was 141.8MB in the beginning and 350.8MB in the end (delta: -209.1MB). Peak memory consumption was 268.0MB. Max. memory is 16.1GB. * Witness Printer took 93.13ms. Allocated memory is still 453.0MB. Free memory was 350.8MB in the beginning and 345.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 96]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.6s, OverallIterations: 15, TraceHistogramMax: 92, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1209 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1209 mSDsluCounter, 352 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8870 IncrementalHoareTripleChecker+Invalid, 9065 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 195 mSolverCounterUnsat, 47 mSDtfsCounter, 8870 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2765 GetRequests, 1647 SyntacticMatches, 91 SemanticMatches, 1027 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19446 ImplicationChecksByTransitivity, 21.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=14, InterpolantAutomatonStates: 549, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 2034 NumberOfCodeBlocks, 1962 NumberOfCodeBlocksAsserted, 158 NumberOfCheckSat, 2825 ConstructedInterpolants, 0 QuantifiedInterpolants, 6812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1962 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 31437/72314 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Location Invariant Derived location invariant: (((main__y == 50) && (main__x <= 2)) && (\old(__return_720) == __return_720)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 3)) - InvariantResult [Line: 59]: Location Invariant Derived location invariant: (((main__x <= 7) && (main__y == 50)) && (\old(__return_720) == __return_720)) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 1)) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: (((main__x <= 8) && (main__y == 50)) && (\old(__return_720) == __return_720)) - InvariantResult [Line: 53]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 6)) - InvariantResult [Line: 72]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((89 == main__y) && (89 == main__x)) && (\old(__return_720) == __return_720)) || (((53 == main__y) && (53 == main__x)) && (\old(__return_720) == __return_720))) || (((71 == main__y) && (\old(__return_720) == __return_720)) && (71 == main__x))) || (((79 == main__x) && (79 == main__y)) && (\old(__return_720) == __return_720))) || (((88 == main__y) && (\old(__return_720) == __return_720)) && (88 == main__x))) || (((81 == main__y) && (\old(__return_720) == __return_720)) && (81 == main__x))) || (((100 == main__y) && (100 <= main__x)) && (\old(__return_720) == __return_720))) || (((65 == main__y) && (\old(__return_720) == __return_720)) && (65 == main__x))) || (((main__y == 50) && (main__x <= 50)) && (\old(__return_720) == __return_720))) || (((52 == main__y) && (\old(__return_720) == __return_720)) && (52 == main__x))) || (((74 == main__x) && (\old(__return_720) == __return_720)) && (74 == main__y))) || (((64 == main__x) && (64 == main__y)) && (\old(__return_720) == __return_720))) || (((\old(__return_720) == __return_720) && (main__x == 93)) && (main__y == 93))) || (((\old(__return_720) == __return_720) && (main__x == 80)) && (main__y == 80))) || (((main__y == 86) && (\old(__return_720) == __return_720)) && (main__x == 86))) || (((main__x == 96) && (main__y == 96)) && (\old(__return_720) == __return_720))) || (((87 == main__x) && (\old(__return_720) == __return_720)) && (87 == main__y))) || (((90 == main__x) && (\old(__return_720) == __return_720)) && (90 == main__y))) || (((\old(__return_720) == __return_720) && (92 == main__y)) && (92 == main__x))) || (((60 == main__x) && (60 == main__y)) && (\old(__return_720) == __return_720))) || (((63 == main__x) && (63 == main__y)) && (\old(__return_720) == __return_720))) || (((98 == main__x) && (98 == main__y)) && (\old(__return_720) == __return_720))) || (((59 == main__y) && (\old(__return_720) == __return_720)) && (59 == main__x))) || (((72 == main__x) && (72 == main__y)) && (\old(__return_720) == __return_720))) || (((85 == main__y) && (\old(__return_720) == __return_720)) && (85 == main__x))) || (((73 == main__x) && (\old(__return_720) == __return_720)) && (73 == main__y))) || (((97 == main__x) && (\old(__return_720) == __return_720)) && (97 == main__y))) || (((main__x == 83) && (\old(__return_720) == __return_720)) && (main__y == 83))) || (((main__y == 54) && (main__x == 54)) && (\old(__return_720) == __return_720))) || (((91 == main__y) && (91 == main__x)) && (\old(__return_720) == __return_720))) || (((main__x == 61) && (main__y == 61)) && (\old(__return_720) == __return_720))) || (((58 == main__y) && (\old(__return_720) == __return_720)) && (58 == main__x))) || (((69 == main__y) && (\old(__return_720) == __return_720)) && (69 == main__x))) || (((95 == main__y) && (\old(__return_720) == __return_720)) && (95 == main__x))) || (((56 == main__x) && (\old(__return_720) == __return_720)) && (56 == main__y))) || (((55 == main__x) && (\old(__return_720) == __return_720)) && (55 == main__y))) || (((main__x == 75) && (main__y == 75)) && (\old(__return_720) == __return_720))) || (((68 == main__x) && (\old(__return_720) == __return_720)) && (68 == main__y))) || (((\old(__return_720) == __return_720) && (57 == main__x)) && (57 == main__y))) || (((51 == main__y) && (51 == main__x)) && (\old(__return_720) == __return_720))) || (((66 == main__y) && (66 == main__x)) && (\old(__return_720) == __return_720))) || (((main__y == 99) && (main__x == 99)) && (\old(__return_720) == __return_720))) || (((84 == main__x) && (\old(__return_720) == __return_720)) && (84 == main__y))) || (((67 == main__x) && (67 == main__y)) && (\old(__return_720) == __return_720))) || (((62 == main__x) && (62 == main__y)) && (\old(__return_720) == __return_720))) || (((70 == main__x) && (\old(__return_720) == __return_720)) && (70 == main__y))) || (((94 == main__y) && (94 == main__x)) && (\old(__return_720) == __return_720))) || (((76 == main__y) && (76 == main__x)) && (\old(__return_720) == __return_720))) || (((78 == main__y) && (\old(__return_720) == __return_720)) && (78 == main__x))) || (((82 == main__x) && (\old(__return_720) == __return_720)) && (82 == main__y))) || (((\old(__return_720) == __return_720) && (77 == main__x)) && (77 == main__y))) - InvariantResult [Line: 41]: Location Invariant Derived location invariant: (((main__y == 50) && (main__x <= 4)) && (\old(__return_720) == __return_720)) - InvariantResult [Line: 47]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 5)) RESULT: Ultimate proved your program to be correct! [2024-09-12 21:43:42,544 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE