./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-crafted/simple_array_index_value_3.i --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-crafted/simple_array_index_value_3.i -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 8ce03462fe975a31ea60daf5f1377957a781bf3e81bf898be84185f681a4ed0e --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:19:44,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:19:44,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:19:44,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:19:44,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:19:44,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:19:44,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:19:44,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:19:44,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:19:44,370 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:19:44,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:19:44,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:19:44,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:19:44,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:19:44,372 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:19:44,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:19:44,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:19:44,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:19:44,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:19:44,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:19:44,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:19:44,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:19:44,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:19:44,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:19:44,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:19:44,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:19:44,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:19:44,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:19:44,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:19:44,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:19:44,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:19:44,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:19:44,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:19:44,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:19:44,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:19:44,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:19:44,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:19:44,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:19:44,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:19:44,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:19:44,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:19:44,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:19:44,383 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 -> 8ce03462fe975a31ea60daf5f1377957a781bf3e81bf898be84185f681a4ed0e 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:19:44,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:19:44,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:19:44,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:19:44,650 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:19:44,650 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:19:44,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-crafted/simple_array_index_value_3.i [2024-09-11 19:19:45,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:19:46,121 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:19:46,121 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_3.i [2024-09-11 19:19:46,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a280903c3/9a1e166e1c054fa6afd55edd390cc89c/FLAG1849902ee [2024-09-11 19:19:46,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a280903c3/9a1e166e1c054fa6afd55edd390cc89c [2024-09-11 19:19:46,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:19:46,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:19:46,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:19:46,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:19:46,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:19:46,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c24538d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46, skipping insertion in model container [2024-09-11 19:19:46,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:19:46,306 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-crafted/simple_array_index_value_3.i[920,933] [2024-09-11 19:19:46,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:19:46,326 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:19:46,345 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-crafted/simple_array_index_value_3.i[920,933] [2024-09-11 19:19:46,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:19:46,374 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:19:46,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46 WrapperNode [2024-09-11 19:19:46,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:19:46,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:19:46,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:19:46,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:19:46,384 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:19:46" (1/1) ... [2024-09-11 19:19:46,389 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:19:46" (1/1) ... [2024-09-11 19:19:46,407 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2024-09-11 19:19:46,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:19:46,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:19:46,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:19:46,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:19:46,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,436 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-11 19:19:46,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:19:46,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:19:46,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:19:46,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:19:46,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (1/1) ... [2024-09-11 19:19:46,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:19:46,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:19:46,489 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:19:46,492 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:19:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:19:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 19:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-11 19:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 19:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 19:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:19:46,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 19:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 19:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 19:19:46,573 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:19:46,574 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:19:46,656 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-11 19:19:46,657 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:19:46,672 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:19:46,672 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:19:46,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:19:46 BoogieIcfgContainer [2024-09-11 19:19:46,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:19:46,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:19:46,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:19:46,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:19:46,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:19:46" (1/3) ... [2024-09-11 19:19:46,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c2e67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:19:46, skipping insertion in model container [2024-09-11 19:19:46,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:19:46" (2/3) ... [2024-09-11 19:19:46,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c2e67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:19:46, skipping insertion in model container [2024-09-11 19:19:46,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:19:46" (3/3) ... [2024-09-11 19:19:46,678 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.i [2024-09-11 19:19:46,689 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:19:46,690 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:19:46,725 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:19:46,730 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;@6dbc1b82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:19:46,730 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:19:46,733 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:19:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 19:19:46,736 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:19:46,737 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:19:46,737 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:19:46,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash 216261315, now seen corresponding path program 1 times [2024-09-11 19:19:46,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:19:46,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406194008] [2024-09-11 19:19:46,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:46,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:19:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:47,038 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:19:47,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:19:47,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406194008] [2024-09-11 19:19:47,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406194008] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:19:47,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:19:47,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 19:19:47,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466814723] [2024-09-11 19:19:47,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:19:47,051 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:19:47,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:19:47,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:19:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:19:47,081 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:19:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:19:47,126 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2024-09-11 19:19:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:19:47,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:19:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:19:47,155 INFO L225 Difference]: With dead ends: 24 [2024-09-11 19:19:47,156 INFO L226 Difference]: Without dead ends: 12 [2024-09-11 19:19:47,158 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:19:47,161 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:19:47,161 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:19:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-11 19:19:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-11 19:19:47,204 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:19:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-09-11 19:19:47,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2024-09-11 19:19:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:19:47,206 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-09-11 19:19:47,206 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:19:47,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-09-11 19:19:47,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 19:19:47,207 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:19:47,207 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:19:47,208 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:19:47,208 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:19:47,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash 216320897, now seen corresponding path program 1 times [2024-09-11 19:19:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:19:47,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839063203] [2024-09-11 19:19:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:47,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:19:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:47,273 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:19:47,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:19:47,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839063203] [2024-09-11 19:19:47,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839063203] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:19:47,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:19:47,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:19:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447136131] [2024-09-11 19:19:47,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:19:47,276 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:19:47,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:19:47,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:19:47,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:19:47,277 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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:19:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:19:47,307 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-09-11 19:19:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:19:47,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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:19:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:19:47,308 INFO L225 Difference]: With dead ends: 32 [2024-09-11 19:19:47,308 INFO L226 Difference]: Without dead ends: 22 [2024-09-11 19:19:47,308 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:19:47,309 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:19:47,309 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 12 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:19:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-11 19:19:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 13. [2024-09-11 19:19:47,313 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:19:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-09-11 19:19:47,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2024-09-11 19:19:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:19:47,314 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-09-11 19:19:47,314 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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:19:47,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-09-11 19:19:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 19:19:47,315 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:19:47,315 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:19:47,315 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:19:47,315 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:19:47,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:47,316 INFO L85 PathProgramCache]: Analyzing trace with hash 337865790, now seen corresponding path program 1 times [2024-09-11 19:19:47,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:19:47,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681526419] [2024-09-11 19:19:47,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:47,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:19:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:47,404 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:19:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:19:47,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681526419] [2024-09-11 19:19:47,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681526419] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:19:47,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010602795] [2024-09-11 19:19:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:47,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:47,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:19:47,407 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:19:47,409 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:19:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:47,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-11 19:19:47,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:19:47,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 19:19:47,557 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:19:47,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:19:47,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-09-11 19:19:47,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-09-11 19:19:47,673 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:19:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010602795] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:19:47,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:19:47,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2024-09-11 19:19:47,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894747578] [2024-09-11 19:19:47,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:19:47,674 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:19:47,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:19:47,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:19:47,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:19:47,675 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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:19:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:19:47,768 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-09-11 19:19:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:19:47,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 9 [2024-09-11 19:19:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:19:47,769 INFO L225 Difference]: With dead ends: 42 [2024-09-11 19:19:47,769 INFO L226 Difference]: Without dead ends: 32 [2024-09-11 19:19:47,770 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-09-11 19:19:47,770 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:19:47,771 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:19:47,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-11 19:19:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 14. [2024-09-11 19:19:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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:19:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-09-11 19:19:47,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2024-09-11 19:19:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:19:47,774 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-09-11 19:19:47,774 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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:19:47,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-09-11 19:19:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:19:47,775 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:19:47,775 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:19:47,793 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:19:47,979 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:19:47,980 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:19:47,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash -189209823, now seen corresponding path program 2 times [2024-09-11 19:19:47,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:19:47,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763467626] [2024-09-11 19:19:47,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:19:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:19:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:19:48,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763467626] [2024-09-11 19:19:48,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763467626] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:19:48,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518628171] [2024-09-11 19:19:48,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:19:48,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:48,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:19:48,107 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:19:48,108 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:19:48,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:19:48,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:19:48,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-11 19:19:48,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:19:48,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 19:19:48,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-09-11 19:19:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:19:48,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:19:48,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2024-09-11 19:19:48,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2024-09-11 19:19:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:19:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518628171] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:19:48,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:19:48,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 8] total 15 [2024-09-11 19:19:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120637502] [2024-09-11 19:19:48,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:19:48,531 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-11 19:19:48,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:19:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-11 19:19:48,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:19:48,534 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:19:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:19:48,843 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-09-11 19:19:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 19:19:48,843 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:19:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:19:48,844 INFO L225 Difference]: With dead ends: 57 [2024-09-11 19:19:48,844 INFO L226 Difference]: Without dead ends: 47 [2024-09-11 19:19:48,844 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2024-09-11 19:19:48,845 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 111 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:19:48,845 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 33 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:19:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-11 19:19:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 17. [2024-09-11 19:19:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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:19:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-09-11 19:19:48,853 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2024-09-11 19:19:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:19:48,853 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-09-11 19:19:48,853 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:19:48,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-09-11 19:19:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-11 19:19:48,854 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:19:48,854 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:19:48,866 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:19:49,058 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:49,059 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:19:49,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 864913936, now seen corresponding path program 1 times [2024-09-11 19:19:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:19:49,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174643414] [2024-09-11 19:19:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:49,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:19:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:19:49,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:19:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174643414] [2024-09-11 19:19:49,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174643414] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:19:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592465303] [2024-09-11 19:19:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:49,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:49,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:19:49,187 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:19:49,194 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:19:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:49,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 19:19:49,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:19:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:19:49,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:19:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:19:49,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592465303] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:19:49,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:19:49,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-09-11 19:19:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291618556] [2024-09-11 19:19:49,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:19:49,361 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:19:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:19:49,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:19:49,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:19:49,363 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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:19:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:19:49,550 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2024-09-11 19:19:49,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:19:49,551 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 16 [2024-09-11 19:19:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:19:49,553 INFO L225 Difference]: With dead ends: 92 [2024-09-11 19:19:49,554 INFO L226 Difference]: Without dead ends: 80 [2024-09-11 19:19:49,554 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2024-09-11 19:19:49,554 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 163 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:19:49,555 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 94 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:19:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-11 19:19:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 22. [2024-09-11 19:19:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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:19:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-11 19:19:49,584 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2024-09-11 19:19:49,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:19:49,584 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-11 19:19:49,584 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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:19:49,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-11 19:19:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 19:19:49,586 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:19:49,586 INFO L216 NwaCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:19:49,600 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:19:49,786 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:49,787 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:19:49,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1224900979, now seen corresponding path program 2 times [2024-09-11 19:19:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:19:49,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672319046] [2024-09-11 19:19:49,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:49,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:19:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:19:50,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:19:50,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672319046] [2024-09-11 19:19:50,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672319046] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:19:50,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855123516] [2024-09-11 19:19:50,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:19:50,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:50,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:19:50,022 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:19:50,025 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:19:50,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:19:50,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:19:50,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-11 19:19:50,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:19:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:19:50,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:19:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:19:50,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855123516] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:19:50,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:19:50,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-09-11 19:19:50,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827227546] [2024-09-11 19:19:50,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:19:50,355 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 19:19:50,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:19:50,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 19:19:50,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-09-11 19:19:50,356 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 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:19:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:19:51,681 INFO L93 Difference]: Finished difference Result 192 states and 221 transitions. [2024-09-11 19:19:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-11 19:19:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 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 21 [2024-09-11 19:19:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:19:51,683 INFO L225 Difference]: With dead ends: 192 [2024-09-11 19:19:51,683 INFO L226 Difference]: Without dead ends: 180 [2024-09-11 19:19:51,683 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=306, Invalid=506, Unknown=0, NotChecked=0, Total=812 [2024-09-11 19:19:51,684 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 569 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:19:51,684 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 434 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:19:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-09-11 19:19:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 32. [2024-09-11 19:19:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 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:19:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-09-11 19:19:51,709 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2024-09-11 19:19:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:19:51,709 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-09-11 19:19:51,709 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 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:19:51,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-09-11 19:19:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-11 19:19:51,710 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:19:51,710 INFO L216 NwaCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:19:51,722 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:19:51,911 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:51,912 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:19:51,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash 661523565, now seen corresponding path program 3 times [2024-09-11 19:19:51,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:19:51,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729125264] [2024-09-11 19:19:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:51,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:19:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:19:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:19:52,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729125264] [2024-09-11 19:19:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729125264] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:19:52,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181194679] [2024-09-11 19:19:52,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:19:52,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:52,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:19:52,365 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:19:52,366 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:20:36,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-11 19:20:36,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:20:36,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-11 19:20:36,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:20:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:20:36,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:20:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:20:36,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181194679] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:20:36,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:20:36,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2024-09-11 19:20:36,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739851705] [2024-09-11 19:20:36,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:20:36,915 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-11 19:20:36,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:20:36,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-11 19:20:36,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2024-09-11 19:20:36,917 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 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:21:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:21:07,515 INFO L93 Difference]: Finished difference Result 392 states and 451 transitions. [2024-09-11 19:21:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-09-11 19:21:07,517 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 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 31 [2024-09-11 19:21:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:21:07,520 INFO L225 Difference]: With dead ends: 392 [2024-09-11 19:21:07,520 INFO L226 Difference]: Without dead ends: 380 [2024-09-11 19:21:07,521 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=1216, Invalid=2206, Unknown=0, NotChecked=0, Total=3422 [2024-09-11 19:21:07,529 INFO L434 NwaCegarLoop]: 95 mSDtfsCounter, 2504 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2504 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:21:07,529 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2504 Valid, 1864 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-09-11 19:21:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-09-11 19:21:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 52. [2024-09-11 19:21:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 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:21:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2024-09-11 19:21:07,555 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 31 [2024-09-11 19:21:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:21:07,555 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2024-09-11 19:21:07,556 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 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:21:07,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2024-09-11 19:21:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-11 19:21:07,557 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:21:07,557 INFO L216 NwaCegarLoop]: trace histogram [38, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:21:07,584 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 19:21:07,757 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:21:07,758 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:21:07,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:07,758 INFO L85 PathProgramCache]: Analyzing trace with hash 669884461, now seen corresponding path program 4 times [2024-09-11 19:21:07,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:21:07,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110931305] [2024-09-11 19:21:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:21:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:21:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:21:08,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:21:08,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110931305] [2024-09-11 19:21:08,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110931305] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:21:08,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359827360] [2024-09-11 19:21:08,966 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 19:21:08,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:21:08,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:21:08,968 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:21:08,969 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:21:10,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 19:21:10,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:21:10,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-09-11 19:21:10,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:21:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:21:11,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:21:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:21:12,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359827360] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:21:12,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:21:12,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 80 [2024-09-11 19:21:12,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948469807] [2024-09-11 19:21:12,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:21:12,862 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2024-09-11 19:21:12,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:21:12,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2024-09-11 19:21:12,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1758, Invalid=4722, Unknown=0, NotChecked=0, Total=6480 [2024-09-11 19:21:12,866 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 81 states, 81 states have (on average 1.123456790123457) internal successors, (91), 80 states have internal predecessors, (91), 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:21:26,120 WARN L293 SmtUtils]: Spent 12.50s on a formula simplification. DAG size of input: 158 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:21:44,358 WARN L293 SmtUtils]: Spent 13.94s on a formula simplification. DAG size of input: 154 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:22:00,473 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 150 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:22:23,667 WARN L293 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 146 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:22:47,247 WARN L293 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 142 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:23:13,929 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 138 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:24:16,783 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 130 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)