./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/vnew1.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/loops-crafted-1/vnew1.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 92c9725cc4c9709a9ab81826fb3481ef81541ab6f68244b6727f50e97bc0f0c0 --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:34:39,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:34:39,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:34:39,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:34:39,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:34:39,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:34:39,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:34:39,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:34:39,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:34:39,688 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:34:39,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:34:39,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:34:39,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:34:39,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:34:39,689 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:34:39,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:34:39,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:34:39,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:34:39,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:34:39,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:34:39,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:34:39,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:34:39,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:34:39,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:34:39,694 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:34:39,694 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:34:39,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:34:39,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:34:39,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:34:39,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:34:39,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:34:39,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:34:39,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:34:39,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:34:39,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:34:39,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:34:39,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:34:39,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:34:39,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:34:39,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:34:39,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:34:39,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:34:39,699 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 -> 92c9725cc4c9709a9ab81826fb3481ef81541ab6f68244b6727f50e97bc0f0c0 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:34:39,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:34:39,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:34:39,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:34:39,979 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:34:39,979 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:34:39,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/vnew1.c [2024-09-11 19:34:41,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:34:41,489 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:34:41,489 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/vnew1.c [2024-09-11 19:34:41,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/3bf7395ac/a1279333766046c49b35e5f05c1adce9/FLAG68f0493ab [2024-09-11 19:34:41,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/3bf7395ac/a1279333766046c49b35e5f05c1adce9 [2024-09-11 19:34:41,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:34:41,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:34:41,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:34:41,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:34:41,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:34:41,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:34:41" (1/1) ... [2024-09-11 19:34:41,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136f52bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:41, skipping insertion in model container [2024-09-11 19:34:41,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:34:41" (1/1) ... [2024-09-11 19:34:41,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:34:42,115 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/loops-crafted-1/vnew1.c[403,416] [2024-09-11 19:34:42,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:34:42,146 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:34:42,159 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/loops-crafted-1/vnew1.c[403,416] [2024-09-11 19:34:42,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:34:42,185 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:34:42,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42 WrapperNode [2024-09-11 19:34:42,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:34:42,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:34:42,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:34:42,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:34:42,193 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:34:42" (1/1) ... [2024-09-11 19:34:42,198 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:34:42" (1/1) ... [2024-09-11 19:34:42,217 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2024-09-11 19:34:42,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:34:42,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:34:42,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:34:42,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:34:42,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (1/1) ... [2024-09-11 19:34:42,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (1/1) ... [2024-09-11 19:34:42,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (1/1) ... [2024-09-11 19:34:42,248 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-11 19:34:42,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (1/1) ... [2024-09-11 19:34:42,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (1/1) ... [2024-09-11 19:34:42,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (1/1) ... [2024-09-11 19:34:42,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (1/1) ... [2024-09-11 19:34:42,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (1/1) ... [2024-09-11 19:34:42,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (1/1) ... [2024-09-11 19:34:42,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:34:42,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:34:42,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:34:42,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:34:42,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (1/1) ... [2024-09-11 19:34:42,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:34:42,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:34:42,299 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:34:42,302 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:34:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:34:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:34:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 19:34:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:34:42,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:34:42,395 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:34:42,397 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:34:42,502 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-11 19:34:42,503 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:34:42,528 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:34:42,529 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:34:42,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:34:42 BoogieIcfgContainer [2024-09-11 19:34:42,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:34:42,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:34:42,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:34:42,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:34:42,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:34:41" (1/3) ... [2024-09-11 19:34:42,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e61dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:34:42, skipping insertion in model container [2024-09-11 19:34:42,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:34:42" (2/3) ... [2024-09-11 19:34:42,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e61dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:34:42, skipping insertion in model container [2024-09-11 19:34:42,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:34:42" (3/3) ... [2024-09-11 19:34:42,540 INFO L112 eAbstractionObserver]: Analyzing ICFG vnew1.c [2024-09-11 19:34:42,558 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:34:42,558 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:34:42,641 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:34:42,662 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;@549550ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:34:42,662 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:34:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 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:34:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 19:34:42,674 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:34:42,675 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:34:42,675 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:34:42,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:42,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1610966213, now seen corresponding path program 1 times [2024-09-11 19:34:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:34:42,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083817587] [2024-09-11 19:34:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:34:42,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:34:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:34:42,866 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:34:42,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:34:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083817587] [2024-09-11 19:34:42,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083817587] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:34:42,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:34:42,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:34:42,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808436183] [2024-09-11 19:34:42,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:34:42,875 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:34:42,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:34:42,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:34:42,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:34:42,903 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 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 3.5) internal successors, (7), 2 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:34:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:34:42,921 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2024-09-11 19:34:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:34:42,923 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:34:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:34:42,930 INFO L225 Difference]: With dead ends: 21 [2024-09-11 19:34:42,930 INFO L226 Difference]: Without dead ends: 9 [2024-09-11 19:34:42,933 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:34:42,936 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:34:42,937 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:34:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-09-11 19:34:42,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-09-11 19:34:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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:34:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-09-11 19:34:42,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2024-09-11 19:34:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:34:42,961 INFO L474 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-09-11 19:34:42,961 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:34:42,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-09-11 19:34:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 19:34:42,962 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:34:42,962 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:34:42,962 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:34:42,963 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:34:42,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1607272129, now seen corresponding path program 1 times [2024-09-11 19:34:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:34:42,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74020859] [2024-09-11 19:34:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:34:42,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:34:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:34:43,504 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:34:43,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:34:43,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74020859] [2024-09-11 19:34:43,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74020859] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:34:43,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:34:43,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:34:43,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350314519] [2024-09-11 19:34:43,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:34:43,506 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:34:43,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:34:43,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:34:43,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:34:43,512 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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:34:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:34:43,633 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-09-11 19:34:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:34:43,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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:34:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:34:43,635 INFO L225 Difference]: With dead ends: 16 [2024-09-11 19:34:43,635 INFO L226 Difference]: Without dead ends: 14 [2024-09-11 19:34:43,636 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:34:43,637 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:34:43,639 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:34:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-11 19:34:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-09-11 19:34:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:34:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-09-11 19:34:43,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2024-09-11 19:34:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:34:43,652 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-09-11 19:34:43,653 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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:34:43,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-09-11 19:34:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 19:34:43,654 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:34:43,654 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:34:43,655 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:34:43,655 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:34:43,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:43,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1662725407, now seen corresponding path program 1 times [2024-09-11 19:34:43,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:34:43,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101940737] [2024-09-11 19:34:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:34:43,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:34:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:34:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:34:44,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:34:44,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101940737] [2024-09-11 19:34:44,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101940737] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:34:44,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998571759] [2024-09-11 19:34:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:34:44,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:34:44,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:34:44,084 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:34:44,087 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:34:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:34:44,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-11 19:34:44,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:34:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:34:44,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:34:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:34:44,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998571759] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:34:44,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:34:44,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-11 19:34:44,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783545119] [2024-09-11 19:34:44,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:34:44,829 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 19:34:44,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:34:44,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 19:34:44,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:34:44,831 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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:34:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:34:45,152 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2024-09-11 19:34:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 19:34:45,153 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 8 [2024-09-11 19:34:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:34:45,155 INFO L225 Difference]: With dead ends: 27 [2024-09-11 19:34:45,155 INFO L226 Difference]: Without dead ends: 25 [2024-09-11 19:34:45,156 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-09-11 19:34:45,157 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:34:45,157 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 37 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:34:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-11 19:34:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2024-09-11 19:34:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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:34:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-09-11 19:34:45,168 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 8 [2024-09-11 19:34:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:34:45,169 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-09-11 19:34:45,169 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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:34:45,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-09-11 19:34:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:34:45,170 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:34:45,170 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:34:45,187 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:34:45,374 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:34:45,375 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:34:45,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1953404477, now seen corresponding path program 1 times [2024-09-11 19:34:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:34:45,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622922918] [2024-09-11 19:34:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:34:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:34:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:34:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:34:45,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:34:45,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622922918] [2024-09-11 19:34:45,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622922918] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:34:45,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:34:45,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:34:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834715424] [2024-09-11 19:34:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:34:45,499 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:34:45,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:34:45,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:34:45,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:34:45,503 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:34:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:34:45,529 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-09-11 19:34:45,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:34:45,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:34:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:34:45,530 INFO L225 Difference]: With dead ends: 28 [2024-09-11 19:34:45,531 INFO L226 Difference]: Without dead ends: 20 [2024-09-11 19:34:45,531 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:34:45,533 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:34:45,535 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:34:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-11 19:34:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-09-11 19:34:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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:34:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-09-11 19:34:45,545 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2024-09-11 19:34:45,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:34:45,546 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-09-11 19:34:45,546 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:34:45,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-09-11 19:34:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 19:34:45,547 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:34:45,547 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:34:45,547 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:34:45,547 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:34:45,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash -848359743, now seen corresponding path program 2 times [2024-09-11 19:34:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:34:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3477663] [2024-09-11 19:34:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:34:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:34:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:34:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:34:45,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:34:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3477663] [2024-09-11 19:34:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3477663] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:34:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755282761] [2024-09-11 19:34:45,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:34:45,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:34:45,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:34:45,790 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:34:45,801 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:34:45,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:34:45,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:34:45,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-11 19:34:45,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:34:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:34:46,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:34:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:34:46,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755282761] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:34:46,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:34:46,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-09-11 19:34:46,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475532157] [2024-09-11 19:34:46,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:34:46,241 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 19:34:46,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:34:46,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 19:34:46,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-09-11 19:34:46,242 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 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:34:54,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:58,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:35:02,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:35:11,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:35:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:35:11,353 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-09-11 19:35:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 19:35:11,354 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 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) Word has length 11 [2024-09-11 19:35:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:35:11,355 INFO L225 Difference]: With dead ends: 53 [2024-09-11 19:35:11,355 INFO L226 Difference]: Without dead ends: 51 [2024-09-11 19:35:11,355 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482 [2024-09-11 19:35:11,356 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 69 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 13 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:35:11,356 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 70 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 223 Invalid, 4 Unknown, 0 Unchecked, 16.3s Time] [2024-09-11 19:35:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-11 19:35:11,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2024-09-11 19:35:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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:35:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-09-11 19:35:11,378 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 11 [2024-09-11 19:35:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:35:11,378 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-09-11 19:35:11,378 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 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:35:11,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:35:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-09-11 19:35:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-11 19:35:11,380 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:35:11,381 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:35:11,403 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 19:35:11,581 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:35:11,582 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:35:11,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:35:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash 893204833, now seen corresponding path program 1 times [2024-09-11 19:35:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:35:11,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635889056] [2024-09-11 19:35:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:35:11,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:35:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:35:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:35:11,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:35:11,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635889056] [2024-09-11 19:35:11,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635889056] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:35:11,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103396888] [2024-09-11 19:35:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:35:11,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:35:11,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:35:11,933 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:35:11,935 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:35:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:35:11,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 19:35:11,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:35:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:35:12,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:35:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:35:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103396888] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:35:13,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:35:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2024-09-11 19:35:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172020881] [2024-09-11 19:35:13,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:35:13,196 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 19:35:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:35:13,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 19:35:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:35:13,198 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 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:35:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:35:13,479 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-09-11 19:35:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 19:35:13,479 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 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:35:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:35:13,480 INFO L225 Difference]: With dead ends: 53 [2024-09-11 19:35:13,482 INFO L226 Difference]: Without dead ends: 34 [2024-09-11 19:35:13,483 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2024-09-11 19:35:13,484 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:35:13,484 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 33 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:35:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-11 19:35:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-11 19:35:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 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:35:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-09-11 19:35:13,515 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 14 [2024-09-11 19:35:13,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:35:13,515 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-09-11 19:35:13,516 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 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:35:13,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:35:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-09-11 19:35:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-11 19:35:13,517 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:35:13,517 INFO L216 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:35:13,535 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:35:13,721 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 19:35:13,722 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:35:13,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:35:13,722 INFO L85 PathProgramCache]: Analyzing trace with hash -301819199, now seen corresponding path program 3 times [2024-09-11 19:35:13,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:35:13,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892189323] [2024-09-11 19:35:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:35:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:35:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:35:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:35:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:35:14,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892189323] [2024-09-11 19:35:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892189323] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:35:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770853255] [2024-09-11 19:35:14,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:35:14,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:35:14,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:35:14,368 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:35:14,369 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:35:14,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-11 19:35:14,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:35:14,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-09-11 19:35:14,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:35:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:35:15,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:35:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:35:16,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770853255] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:35:16,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:35:16,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 40 [2024-09-11 19:35:16,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192758708] [2024-09-11 19:35:16,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:35:16,029 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-09-11 19:35:16,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:35:16,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-09-11 19:35:16,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1304, Unknown=0, NotChecked=0, Total=1560 [2024-09-11 19:35:16,031 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 40 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 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:35:44,010 WARN L293 SmtUtils]: Spent 27.43s on a formula simplification. DAG size of input: 95 DAG size of output: 95 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:36:01,260 WARN L293 SmtUtils]: Spent 17.03s on a formula simplification. DAG size of input: 70 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:37:10,612 WARN L293 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 97 DAG size of output: 97 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:37:35,573 WARN L293 SmtUtils]: Spent 24.78s on a formula simplification. DAG size of input: 72 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:37:37,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:37:39,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:37:43,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:37:47,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:37:51,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:37:55,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:37:58,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:38:29,318 WARN L293 SmtUtils]: Spent 22.04s on a formula simplification. DAG size of input: 87 DAG size of output: 87 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)