./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_3.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 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:36:11,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:36:11,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:36:11,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:36:11,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:36:11,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:36:11,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:36:11,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:36:11,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:36:11,811 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:36:11,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:36:11,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:36:11,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:36:11,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:36:11,815 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:36:11,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:36:11,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:36:11,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:36:11,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:36:11,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:36:11,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:36:11,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:36:11,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:36:11,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:36:11,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:36:11,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:36:11,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:36:11,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:36:11,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:36:11,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:36:11,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:36:11,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:36:11,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:36:11,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:36:11,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:36:11,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:36:11,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:36:11,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:36:11,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:36:11,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:36:11,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:36:11,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:36:11,826 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 -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 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-11 19:36:12,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:36:12,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:36:12,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:36:12,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:36:12,069 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:36:12,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_3.c [2024-09-11 19:36:13,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:36:13,691 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:36:13,692 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_3.c [2024-09-11 19:36:13,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4f8bd8071/f07518b5f6d64d2bb2db0495b3dacfb0/FLAGd9bd6b274 [2024-09-11 19:36:14,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4f8bd8071/f07518b5f6d64d2bb2db0495b3dacfb0 [2024-09-11 19:36:14,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:36:14,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:36:14,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:36:14,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:36:14,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:36:14,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cedb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14, skipping insertion in model container [2024-09-11 19:36:14,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:36:14,259 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_3.c[784,797] [2024-09-11 19:36:14,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:36:14,281 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:36:14,296 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_3.c[784,797] [2024-09-11 19:36:14,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:36:14,313 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:36:14,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14 WrapperNode [2024-09-11 19:36:14,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:36:14,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:36:14,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:36:14,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:36:14,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,345 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2024-09-11 19:36:14,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:36:14,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:36:14,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:36:14,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:36:14,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,372 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-11 19:36:14,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:36:14,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:36:14,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:36:14,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:36:14,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (1/1) ... [2024-09-11 19:36:14,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:36:14,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:14,423 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-11 19:36:14,425 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-11 19:36:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:36:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:36:14,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:36:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:36:14,543 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:36:14,545 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:36:14,638 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-11 19:36:14,638 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:36:14,671 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:36:14,671 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-11 19:36:14,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:36:14 BoogieIcfgContainer [2024-09-11 19:36:14,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:36:14,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:36:14,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:36:14,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:36:14,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:36:14" (1/3) ... [2024-09-11 19:36:14,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b43cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:36:14, skipping insertion in model container [2024-09-11 19:36:14,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:14" (2/3) ... [2024-09-11 19:36:14,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b43cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:36:14, skipping insertion in model container [2024-09-11 19:36:14,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:36:14" (3/3) ... [2024-09-11 19:36:14,679 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_3.c [2024-09-11 19:36:14,691 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:36:14,692 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:36:14,735 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:36:14,741 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;@21c3bd79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:36:14,741 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:36:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 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-11 19:36:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-11 19:36:14,750 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:14,750 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-11 19:36:14,751 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:14,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2570098, now seen corresponding path program 1 times [2024-09-11 19:36:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:14,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446702354] [2024-09-11 19:36:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:14,903 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-11 19:36:14,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:14,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446702354] [2024-09-11 19:36:14,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446702354] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:36:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:36:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:36:14,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453121522] [2024-09-11 19:36:14,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:36:14,914 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:36:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:14,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:36:14,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:36:14,941 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11 19:36:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:14,972 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2024-09-11 19:36:14,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:36:14,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2024-09-11 19:36:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:14,981 INFO L225 Difference]: With dead ends: 21 [2024-09-11 19:36:14,982 INFO L226 Difference]: Without dead ends: 9 [2024-09-11 19:36:14,984 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:36:14,987 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:14,991 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-09-11 19:36:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-09-11 19:36:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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-11 19:36:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-09-11 19:36:15,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 4 [2024-09-11 19:36:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:15,021 INFO L474 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-09-11 19:36:15,021 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11 19:36:15,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2024-09-11 19:36:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-11 19:36:15,023 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:15,024 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-11 19:36:15,024 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:36:15,025 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:15,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2541268, now seen corresponding path program 1 times [2024-09-11 19:36:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026490203] [2024-09-11 19:36:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:15,144 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-11 19:36:15,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:15,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026490203] [2024-09-11 19:36:15,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026490203] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:36:15,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:36:15,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:36:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232705879] [2024-09-11 19:36:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:36:15,151 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:36:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:36:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:36:15,152 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-11 19:36:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:15,216 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2024-09-11 19:36:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:36:15,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2024-09-11 19:36:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:15,221 INFO L225 Difference]: With dead ends: 17 [2024-09-11 19:36:15,221 INFO L226 Difference]: Without dead ends: 14 [2024-09-11 19:36:15,221 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:36:15,222 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:15,223 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 12 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:36:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-11 19:36:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2024-09-11 19:36:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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-11 19:36:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-09-11 19:36:15,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 4 [2024-09-11 19:36:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:15,236 INFO L474 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-09-11 19:36:15,236 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-11 19:36:15,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2024-09-11 19:36:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 19:36:15,238 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:15,240 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:15,240 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:36:15,241 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:15,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1569449088, now seen corresponding path program 1 times [2024-09-11 19:36:15,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:15,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461879292] [2024-09-11 19:36:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:15,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:15,302 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-11 19:36:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461879292] [2024-09-11 19:36:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461879292] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:36:15,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:36:15,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:36:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245130274] [2024-09-11 19:36:15,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:36:15,305 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:36:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:15,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:36:15,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:36:15,307 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11 19:36:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:15,329 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2024-09-11 19:36:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:36:15,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2024-09-11 19:36:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:15,330 INFO L225 Difference]: With dead ends: 21 [2024-09-11 19:36:15,330 INFO L226 Difference]: Without dead ends: 13 [2024-09-11 19:36:15,331 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:36:15,332 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:15,333 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-11 19:36:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2024-09-11 19:36:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-11 19:36:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-09-11 19:36:15,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2024-09-11 19:36:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:15,337 INFO L474 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-09-11 19:36:15,337 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11 19:36:15,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2024-09-11 19:36:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:36:15,338 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:15,338 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:15,338 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:36:15,338 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:15,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1644603312, now seen corresponding path program 1 times [2024-09-11 19:36:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:15,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935578261] [2024-09-11 19:36:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:15,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:15,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935578261] [2024-09-11 19:36:15,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935578261] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:36:15,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:36:15,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:36:15,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510865787] [2024-09-11 19:36:15,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:36:15,407 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:36:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:15,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:36:15,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:36:15,411 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11 19:36:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:15,423 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-09-11 19:36:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:36:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2024-09-11 19:36:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:15,424 INFO L225 Difference]: With dead ends: 21 [2024-09-11 19:36:15,425 INFO L226 Difference]: Without dead ends: 12 [2024-09-11 19:36:15,426 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:36:15,427 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:15,428 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-11 19:36:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-11 19:36:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-11 19:36:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-09-11 19:36:15,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2024-09-11 19:36:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:15,434 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-09-11 19:36:15,434 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11 19:36:15,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-09-11 19:36:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 19:36:15,435 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:15,435 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:15,436 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:36:15,436 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:15,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:15,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1367520426, now seen corresponding path program 1 times [2024-09-11 19:36:15,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:15,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603824762] [2024-09-11 19:36:15,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:15,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:15,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603824762] [2024-09-11 19:36:15,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603824762] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:15,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333159264] [2024-09-11 19:36:15,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:15,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:15,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:15,526 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-11 19:36:15,530 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-11 19:36:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:15,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-11 19:36:15,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:15,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:15,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333159264] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:15,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:15,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-11 19:36:15,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295870357] [2024-09-11 19:36:15,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:15,650 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:36:15,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:15,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:36:15,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:36:15,655 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-11 19:36:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:15,690 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-09-11 19:36:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:36:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) Word has length 11 [2024-09-11 19:36:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:15,691 INFO L225 Difference]: With dead ends: 25 [2024-09-11 19:36:15,691 INFO L226 Difference]: Without dead ends: 15 [2024-09-11 19:36:15,692 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:36:15,692 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:15,693 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-11 19:36:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-11 19:36:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-11 19:36:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-09-11 19:36:15,700 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-09-11 19:36:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:15,701 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-09-11 19:36:15,701 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-11 19:36:15,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-09-11 19:36:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-11 19:36:15,702 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:15,702 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:15,719 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 19:36:15,903 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:15,903 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:15,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:15,904 INFO L85 PathProgramCache]: Analyzing trace with hash 476406064, now seen corresponding path program 2 times [2024-09-11 19:36:15,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:15,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971870153] [2024-09-11 19:36:15,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:15,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:36:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971870153] [2024-09-11 19:36:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971870153] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213893743] [2024-09-11 19:36:15,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:36:15,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:15,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:15,958 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-11 19:36:15,960 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-11 19:36:16,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:36:16,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:36:16,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:36:16,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:16,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:16,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213893743] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:16,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:16,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-11 19:36:16,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593267685] [2024-09-11 19:36:16,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:16,111 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:36:16,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:16,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:36:16,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:36:16,112 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-11 19:36:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:16,287 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2024-09-11 19:36:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 19:36:16,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) Word has length 14 [2024-09-11 19:36:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:16,289 INFO L225 Difference]: With dead ends: 47 [2024-09-11 19:36:16,289 INFO L226 Difference]: Without dead ends: 34 [2024-09-11 19:36:16,290 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-11 19:36:16,291 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:16,291 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-11 19:36:16,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2024-09-11 19:36:16,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-11 19:36:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-09-11 19:36:16,297 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 14 [2024-09-11 19:36:16,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:16,297 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-09-11 19:36:16,297 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-11 19:36:16,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-09-11 19:36:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 19:36:16,298 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:16,299 INFO L216 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:16,315 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:36:16,499 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 19:36:16,500 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:16,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:16,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2131043968, now seen corresponding path program 3 times [2024-09-11 19:36:16,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:16,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880191090] [2024-09-11 19:36:16,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-11 19:36:16,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:16,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880191090] [2024-09-11 19:36:16,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880191090] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:16,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938236582] [2024-09-11 19:36:16,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:36:16,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:16,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:16,588 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-11 19:36:16,590 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-11 19:36:16,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-11 19:36:16,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:36:16,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-11 19:36:16,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-11 19:36:16,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-11 19:36:16,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938236582] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:16,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:16,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-11 19:36:16,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911681027] [2024-09-11 19:36:16,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:16,767 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:36:16,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:16,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:36:16,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:36:16,769 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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-11 19:36:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:16,821 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2024-09-11 19:36:16,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:36:16,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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) Word has length 25 [2024-09-11 19:36:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:16,823 INFO L225 Difference]: With dead ends: 92 [2024-09-11 19:36:16,823 INFO L226 Difference]: Without dead ends: 89 [2024-09-11 19:36:16,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:36:16,824 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:16,825 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-11 19:36:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-09-11 19:36:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 88 states have internal predecessors, (101), 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-11 19:36:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2024-09-11 19:36:16,855 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 25 [2024-09-11 19:36:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:16,856 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-09-11 19:36:16,856 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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-11 19:36:16,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2024-09-11 19:36:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-09-11 19:36:16,861 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:16,862 INFO L216 NwaCegarLoop]: trace histogram [48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1] [2024-09-11 19:36:16,880 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 19:36:17,065 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:36:17,066 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:17,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1621905964, now seen corresponding path program 4 times [2024-09-11 19:36:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6691748] [2024-09-11 19:36:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-09-11 19:36:17,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:17,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6691748] [2024-09-11 19:36:17,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6691748] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:17,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741454270] [2024-09-11 19:36:17,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 19:36:17,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:17,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:17,261 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-11 19:36:17,264 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-11 19:36:17,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 19:36:17,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:36:17,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:36:17,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-09-11 19:36:17,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-09-11 19:36:17,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741454270] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:17,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:17,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-11 19:36:17,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961581873] [2024-09-11 19:36:17,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:17,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 19:36:17,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:17,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 19:36:17,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:36:17,480 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-11 19:36:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:17,568 INFO L93 Difference]: Finished difference Result 301 states and 354 transitions. [2024-09-11 19:36:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:36:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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) Word has length 88 [2024-09-11 19:36:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:17,572 INFO L225 Difference]: With dead ends: 301 [2024-09-11 19:36:17,572 INFO L226 Difference]: Without dead ends: 233 [2024-09-11 19:36:17,573 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:36:17,573 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:17,574 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-09-11 19:36:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-09-11 19:36:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.125) internal successors, (261), 232 states have internal predecessors, (261), 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-11 19:36:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 261 transitions. [2024-09-11 19:36:17,614 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 261 transitions. Word has length 88 [2024-09-11 19:36:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:17,614 INFO L474 AbstractCegarLoop]: Abstraction has 233 states and 261 transitions. [2024-09-11 19:36:17,615 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-11 19:36:17,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 261 transitions. [2024-09-11 19:36:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-09-11 19:36:17,619 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:17,619 INFO L216 NwaCegarLoop]: trace histogram [144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1] [2024-09-11 19:36:17,634 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 19:36:17,820 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:17,820 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:17,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1011087828, now seen corresponding path program 5 times [2024-09-11 19:36:17,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:17,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121219495] [2024-09-11 19:36:17,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-09-11 19:36:18,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:18,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121219495] [2024-09-11 19:36:18,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121219495] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:18,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103491500] [2024-09-11 19:36:18,237 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 19:36:18,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:18,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:18,239 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-11 19:36:18,241 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-11 19:36:18,434 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2024-09-11 19:36:18,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:36:18,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:36:18,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-09-11 19:36:18,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-09-11 19:36:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103491500] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:19,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-09-11 19:36:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177559300] [2024-09-11 19:36:19,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:19,102 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 19:36:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 19:36:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:36:19,103 INFO L87 Difference]: Start difference. First operand 233 states and 261 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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-11 19:36:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:19,161 INFO L93 Difference]: Finished difference Result 350 states and 393 transitions. [2024-09-11 19:36:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:36:19,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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) Word has length 232 [2024-09-11 19:36:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:19,164 INFO L225 Difference]: With dead ends: 350 [2024-09-11 19:36:19,164 INFO L226 Difference]: Without dead ends: 347 [2024-09-11 19:36:19,165 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 457 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:36:19,165 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:19,166 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-09-11 19:36:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-09-11 19:36:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.1242774566473988) internal successors, (389), 346 states have internal predecessors, (389), 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-11 19:36:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 389 transitions. [2024-09-11 19:36:19,209 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 389 transitions. Word has length 232 [2024-09-11 19:36:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:19,210 INFO L474 AbstractCegarLoop]: Abstraction has 347 states and 389 transitions. [2024-09-11 19:36:19,210 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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-11 19:36:19,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 389 transitions. [2024-09-11 19:36:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-09-11 19:36:19,222 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:19,222 INFO L216 NwaCegarLoop]: trace histogram [216, 36, 36, 36, 6, 6, 6, 1, 1, 1, 1] [2024-09-11 19:36:19,240 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 19:36:19,423 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:19,423 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:19,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1991736492, now seen corresponding path program 6 times [2024-09-11 19:36:19,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:19,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498905871] [2024-09-11 19:36:19,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:19,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 0 proven. 28563 refuted. 0 times theorem prover too weak. 4590 trivial. 0 not checked. [2024-09-11 19:36:20,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:20,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498905871] [2024-09-11 19:36:20,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498905871] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:20,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260339205] [2024-09-11 19:36:20,880 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-11 19:36:20,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:20,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:20,882 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-11 19:36:20,884 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-11 19:36:21,061 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 59 check-sat command(s) [2024-09-11 19:36:21,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:36:21,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-11 19:36:21,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 9256 proven. 792 refuted. 0 times theorem prover too weak. 23105 trivial. 0 not checked. [2024-09-11 19:36:21,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 9256 proven. 792 refuted. 0 times theorem prover too weak. 23105 trivial. 0 not checked. [2024-09-11 19:36:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260339205] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:22,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 19] total 48 [2024-09-11 19:36:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414984754] [2024-09-11 19:36:22,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:22,484 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-11 19:36:22,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:22,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-11 19:36:22,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1756, Unknown=0, NotChecked=0, Total=2256 [2024-09-11 19:36:22,486 INFO L87 Difference]: Start difference. First operand 347 states and 389 transitions. Second operand has 48 states, 48 states have (on average 2.5833333333333335) internal successors, (124), 48 states have internal predecessors, (124), 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-11 19:36:27,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:27,238 INFO L93 Difference]: Finished difference Result 683 states and 768 transitions. [2024-09-11 19:36:27,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2024-09-11 19:36:27,239 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.5833333333333335) internal successors, (124), 48 states have internal predecessors, (124), 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) Word has length 346 [2024-09-11 19:36:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:27,242 INFO L225 Difference]: With dead ends: 683 [2024-09-11 19:36:27,242 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:36:27,272 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34778 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=10777, Invalid=80729, Unknown=0, NotChecked=0, Total=91506 [2024-09-11 19:36:27,273 INFO L434 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:27,274 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:36:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:36:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:36:27,275 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-11 19:36:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:36:27,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 346 [2024-09-11 19:36:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:27,276 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:36:27,276 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.5833333333333335) internal successors, (124), 48 states have internal predecessors, (124), 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-11 19:36:27,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:36:27,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:36:27,281 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:36:27,299 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 19:36:27,482 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-11 19:36:27,485 INFO L408 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2024-09-11 19:36:27,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:36:31,615 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:36:31,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:36:31 BoogieIcfgContainer [2024-09-11 19:36:31,636 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:36:31,636 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:36:31,637 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:36:31,637 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:36:31,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:36:14" (3/4) ... [2024-09-11 19:36:31,639 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:36:31,646 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-09-11 19:36:31,646 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 19:36:31,646 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:36:31,646 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:36:31,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:36:31,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:36:31,736 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:36:31,737 INFO L158 Benchmark]: Toolchain (without parser) took 17654.51ms. Allocated memory was 172.0MB in the beginning and 599.8MB in the end (delta: 427.8MB). Free memory was 103.8MB in the beginning and 490.6MB in the end (delta: -386.7MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-09-11 19:36:31,737 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:36:31,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.06ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 92.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 19:36:31,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.95ms. Allocated memory is still 172.0MB. Free memory was 92.6MB in the beginning and 91.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:36:31,738 INFO L158 Benchmark]: Boogie Preprocessor took 40.44ms. Allocated memory is still 172.0MB. Free memory was 91.1MB in the beginning and 89.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:36:31,738 INFO L158 Benchmark]: RCFGBuilder took 284.66ms. Allocated memory is still 172.0MB. Free memory was 89.5MB in the beginning and 138.4MB in the end (delta: -49.0MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-09-11 19:36:31,739 INFO L158 Benchmark]: TraceAbstraction took 16962.40ms. Allocated memory was 172.0MB in the beginning and 599.8MB in the end (delta: 427.8MB). Free memory was 137.8MB in the beginning and 494.8MB in the end (delta: -357.0MB). Peak memory consumption was 296.5MB. Max. memory is 16.1GB. [2024-09-11 19:36:31,739 INFO L158 Benchmark]: Witness Printer took 99.91ms. Allocated memory is still 599.8MB. Free memory was 494.8MB in the beginning and 490.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 19:36:31,742 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.20ms. Allocated memory is still 172.0MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.06ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 92.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.95ms. Allocated memory is still 172.0MB. Free memory was 92.6MB in the beginning and 91.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.44ms. Allocated memory is still 172.0MB. Free memory was 91.1MB in the beginning and 89.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 284.66ms. Allocated memory is still 172.0MB. Free memory was 89.5MB in the beginning and 138.4MB in the end (delta: -49.0MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16962.40ms. Allocated memory was 172.0MB in the beginning and 599.8MB in the end (delta: 427.8MB). Free memory was 137.8MB in the beginning and 494.8MB in the end (delta: -357.0MB). Peak memory consumption was 296.5MB. Max. memory is 16.1GB. * Witness Printer took 99.91ms. Allocated memory is still 599.8MB. Free memory was 494.8MB in the beginning and 490.6MB in the end (delta: 4.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: 29]: 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 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 10, TraceHistogramMax: 216, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 464 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 70 mSDtfsCounter, 464 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1747 GetRequests, 1391 SyntacticMatches, 8 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34905 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=9, InterpolantAutomatonStates: 329, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1457 NumberOfCodeBlocks, 1291 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 2151 ConstructedInterpolants, 0 QuantifiedInterpolants, 6061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1532 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 85176/148839 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: 21]: Loop Invariant Derived loop invariant: (((a <= 6) && (6 == b)) && (6 == c)) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((a <= 5) && (b <= 5)) && (2 == c)) || (((a <= 5) && (5 == c)) && (b <= 5))) || (((a <= 5) && (b <= 5)) && (3 == c))) || (((c == 0) && (a <= 5)) && (b <= 5))) || (((a <= 5) && (b <= 5)) && (6 == c))) || (((a <= 5) && (b <= 5)) && (c == 4))) || (((c == 1) && (a <= 5)) && (b <= 5))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((a <= 5) && (b <= 6)) && (6 == c)) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:36:31,773 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE