./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39b9505d3a064a677b57bccb6de3a4c04e873275d34ee3c16e80371638b07149 --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 20:11:13,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:11:13,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:11:13,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:11:13,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:11:13,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:11:13,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:11:13,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:11:13,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:11:13,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:11:13,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:11:13,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:11:13,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:11:13,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:11:13,112 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:11:13,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:11:13,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:11:13,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:11:13,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:11:13,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:11:13,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:11:13,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:11:13,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:11:13,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:11:13,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:11:13,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:11:13,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:11:13,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:11:13,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:11:13,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:11:13,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:11:13,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:11:13,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:11:13,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:11:13,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:11:13,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:11:13,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:11:13,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:11:13,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:11:13,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:11:13,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:11:13,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:11:13,117 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 -> 39b9505d3a064a677b57bccb6de3a4c04e873275d34ee3c16e80371638b07149 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 20:11:13,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:11:13,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:11:13,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:11:13,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:11:13,348 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:11:13,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2024-09-11 20:11:14,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:11:14,703 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:11:14,704 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2024-09-11 20:11:14,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/bb5fc0e68/51bfca2ccd5e4fccbfab996e6e2eca9a/FLAGc7b1bde37 [2024-09-11 20:11:14,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/bb5fc0e68/51bfca2ccd5e4fccbfab996e6e2eca9a [2024-09-11 20:11:14,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:11:14,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:11:14,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:11:14,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:11:14,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:11:14,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e2ee60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14, skipping insertion in model container [2024-09-11 20:11:14,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:11:14,860 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/nla-digbench-scaling/hard2_valuebound2.c[526,539] [2024-09-11 20:11:14,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:11:14,877 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:11:14,885 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/nla-digbench-scaling/hard2_valuebound2.c[526,539] [2024-09-11 20:11:14,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:11:14,904 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:11:14,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14 WrapperNode [2024-09-11 20:11:14,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:11:14,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:11:14,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:11:14,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:11:14,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,929 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-09-11 20:11:14,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:11:14,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:11:14,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:11:14,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:11:14,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,955 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-11 20:11:14,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:11:14,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:11:14,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:11:14,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:11:14,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (1/1) ... [2024-09-11 20:11:14,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:11:14,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:14,999 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 20:11:15,008 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 20:11:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:11:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:11:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 20:11:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:11:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:11:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:11:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:11:15,090 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:11:15,092 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:11:15,235 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-11 20:11:15,235 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:11:15,263 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:11:15,264 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 20:11:15,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:11:15 BoogieIcfgContainer [2024-09-11 20:11:15,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:11:15,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:11:15,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:11:15,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:11:15,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:11:14" (1/3) ... [2024-09-11 20:11:15,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a322b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:11:15, skipping insertion in model container [2024-09-11 20:11:15,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:11:14" (2/3) ... [2024-09-11 20:11:15,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a322b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:11:15, skipping insertion in model container [2024-09-11 20:11:15,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:11:15" (3/3) ... [2024-09-11 20:11:15,273 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound2.c [2024-09-11 20:11:15,288 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:11:15,288 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:11:15,341 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:11:15,347 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;@26b26bdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:11:15,347 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:11:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 20:11:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 20:11:15,355 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:15,355 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:15,356 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:15,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:15,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1830609328, now seen corresponding path program 1 times [2024-09-11 20:11:15,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:15,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708370617] [2024-09-11 20:11:15,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:15,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:15,483 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 20:11:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708370617] [2024-09-11 20:11:15,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708370617] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:15,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:11:15,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:11:15,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28804462] [2024-09-11 20:11:15,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:15,490 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:11:15,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:15,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:11:15,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:11:15,510 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:15,533 INFO L93 Difference]: Finished difference Result 44 states and 78 transitions. [2024-09-11 20:11:15,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:11:15,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 20:11:15,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:15,540 INFO L225 Difference]: With dead ends: 44 [2024-09-11 20:11:15,540 INFO L226 Difference]: Without dead ends: 21 [2024-09-11 20:11:15,542 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:11:15,544 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:15,545 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:11:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-11 20:11:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-11 20:11:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:11:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2024-09-11 20:11:15,570 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 8 [2024-09-11 20:11:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:15,571 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2024-09-11 20:11:15,571 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:15,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2024-09-11 20:11:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 20:11:15,573 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:15,573 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:15,573 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:11:15,573 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:15,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash -55601966, now seen corresponding path program 1 times [2024-09-11 20:11:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570974578] [2024-09-11 20:11:15,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:15,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:15,705 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 20:11:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570974578] [2024-09-11 20:11:15,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570974578] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:15,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:11:15,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:11:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86246035] [2024-09-11 20:11:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:15,707 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:15,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:15,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:11:15,708 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:15,767 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2024-09-11 20:11:15,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:15,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 20:11:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:15,769 INFO L225 Difference]: With dead ends: 34 [2024-09-11 20:11:15,769 INFO L226 Difference]: Without dead ends: 32 [2024-09-11 20:11:15,769 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:11:15,770 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:15,770 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:11:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-11 20:11:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2024-09-11 20:11:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:11:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-09-11 20:11:15,784 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 8 [2024-09-11 20:11:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:15,784 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-09-11 20:11:15,785 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:15,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-09-11 20:11:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 20:11:15,786 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:15,786 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:15,787 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:11:15,787 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:15,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1587104181, now seen corresponding path program 1 times [2024-09-11 20:11:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485311530] [2024-09-11 20:11:15,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:15,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:15,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:11:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:15,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485311530] [2024-09-11 20:11:15,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485311530] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:15,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:11:15,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:11:15,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616962428] [2024-09-11 20:11:15,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:15,923 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:15,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:15,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:11:15,924 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:11:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:15,981 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-09-11 20:11:15,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:15,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-11 20:11:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:15,982 INFO L225 Difference]: With dead ends: 38 [2024-09-11 20:11:15,982 INFO L226 Difference]: Without dead ends: 36 [2024-09-11 20:11:15,982 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:11:15,983 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:15,983 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:11:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-11 20:11:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-09-11 20:11:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:11:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-09-11 20:11:15,990 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 13 [2024-09-11 20:11:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:15,990 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-09-11 20:11:15,990 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:11:15,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-09-11 20:11:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 20:11:15,992 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:15,992 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:15,992 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:11:15,993 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:15,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:15,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1972613170, now seen corresponding path program 1 times [2024-09-11 20:11:15,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:15,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941147165] [2024-09-11 20:11:15,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:15,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:16,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148200968] [2024-09-11 20:11:16,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:16,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:16,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:16,020 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 20:11:16,022 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 20:11:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:16,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 20:11:16,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:11:16,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:11:16,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:16,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941147165] [2024-09-11 20:11:16,167 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:16,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148200968] [2024-09-11 20:11:16,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148200968] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:16,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:11:16,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:11:16,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560993494] [2024-09-11 20:11:16,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:16,168 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:16,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:16,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:11:16,169 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:11:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:16,231 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2024-09-11 20:11:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:16,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-11 20:11:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:16,232 INFO L225 Difference]: With dead ends: 55 [2024-09-11 20:11:16,233 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 20:11:16,233 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:11:16,234 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:16,234 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:11:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 20:11:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-11 20:11:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 20:11:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-09-11 20:11:16,242 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 18 [2024-09-11 20:11:16,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:16,243 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-09-11 20:11:16,243 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:11:16,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-09-11 20:11:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 20:11:16,244 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:16,244 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:16,257 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 20:11:16,444 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:16,445 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:16,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1810344840, now seen corresponding path program 1 times [2024-09-11 20:11:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:16,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323472128] [2024-09-11 20:11:16,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:16,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365614758] [2024-09-11 20:11:16,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:16,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:16,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:16,458 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 20:11:16,459 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 20:11:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:16,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-11 20:11:16,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:11:16,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:11:16,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:16,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323472128] [2024-09-11 20:11:16,750 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:16,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365614758] [2024-09-11 20:11:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365614758] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:16,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:11:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-11 20:11:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528611724] [2024-09-11 20:11:16,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:16,751 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:11:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:16,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:11:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:11:16,752 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:11:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:16,845 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2024-09-11 20:11:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:11:16,846 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 25 [2024-09-11 20:11:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:16,847 INFO L225 Difference]: With dead ends: 55 [2024-09-11 20:11:16,848 INFO L226 Difference]: Without dead ends: 53 [2024-09-11 20:11:16,849 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:11:16,849 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:16,849 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 79 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:11:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-11 20:11:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-09-11 20:11:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:11:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-09-11 20:11:16,860 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 25 [2024-09-11 20:11:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:16,860 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-09-11 20:11:16,860 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:11:16,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-09-11 20:11:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:11:16,861 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:16,863 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:16,876 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 20:11:17,063 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:17,065 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:17,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash -447891575, now seen corresponding path program 1 times [2024-09-11 20:11:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733333963] [2024-09-11 20:11:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:17,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118981157] [2024-09-11 20:11:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:17,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:17,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:17,084 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 20:11:17,086 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 20:11:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:17,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 20:11:17,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-11 20:11:17,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-11 20:11:17,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:17,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733333963] [2024-09-11 20:11:17,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:17,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118981157] [2024-09-11 20:11:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118981157] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:11:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-11 20:11:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967509424] [2024-09-11 20:11:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:17,268 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:17,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:11:17,268 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:11:18,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:11:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:18,506 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2024-09-11 20:11:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:18,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-09-11 20:11:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:18,508 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:11:18,508 INFO L226 Difference]: Without dead ends: 60 [2024-09-11 20:11:18,509 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:11:18,509 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:18,509 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-09-11 20:11:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-11 20:11:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-11 20:11:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-11 20:11:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-09-11 20:11:18,528 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 35 [2024-09-11 20:11:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:18,529 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-09-11 20:11:18,529 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:11:18,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-09-11 20:11:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-11 20:11:18,530 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:18,531 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:18,543 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 20:11:18,731 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 20:11:18,732 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:18,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:18,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1669992559, now seen corresponding path program 1 times [2024-09-11 20:11:18,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:18,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134268088] [2024-09-11 20:11:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:18,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:18,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:18,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:18,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:18,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:18,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 20:11:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-11 20:11:18,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:18,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134268088] [2024-09-11 20:11:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134268088] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:18,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:11:18,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:11:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158901245] [2024-09-11 20:11:18,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:18,830 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:18,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:11:18,830 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-11 20:11:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:18,866 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2024-09-11 20:11:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2024-09-11 20:11:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:18,867 INFO L225 Difference]: With dead ends: 67 [2024-09-11 20:11:18,867 INFO L226 Difference]: Without dead ends: 55 [2024-09-11 20:11:18,868 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:11:18,868 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:18,869 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:11:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-11 20:11:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-11 20:11:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:11:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-09-11 20:11:18,877 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 41 [2024-09-11 20:11:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:18,877 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-09-11 20:11:18,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-11 20:11:18,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-09-11 20:11:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-11 20:11:18,879 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:18,879 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:18,879 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 20:11:18,879 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:18,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1460518785, now seen corresponding path program 1 times [2024-09-11 20:11:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34053596] [2024-09-11 20:11:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:18,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:18,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673524160] [2024-09-11 20:11:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:18,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:18,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:18,925 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 20:11:18,926 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 20:11:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:18,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-11 20:11:18,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-11 20:11:19,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-11 20:11:20,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:20,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34053596] [2024-09-11 20:11:20,243 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:20,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673524160] [2024-09-11 20:11:20,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673524160] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:20,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:11:20,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-09-11 20:11:20,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171333907] [2024-09-11 20:11:20,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:20,244 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:11:20,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:20,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:11:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:11:20,245 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-11 20:11:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:20,782 INFO L93 Difference]: Finished difference Result 130 states and 175 transitions. [2024-09-11 20:11:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:11:20,783 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 55 [2024-09-11 20:11:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:20,784 INFO L225 Difference]: With dead ends: 130 [2024-09-11 20:11:20,784 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 20:11:20,784 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:11:20,785 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:20,785 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 171 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:11:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 20:11:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-09-11 20:11:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 68 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-11 20:11:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2024-09-11 20:11:20,817 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 55 [2024-09-11 20:11:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:20,817 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2024-09-11 20:11:20,817 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-11 20:11:20,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2024-09-11 20:11:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-09-11 20:11:20,819 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:20,819 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:20,837 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 20:11:21,019 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:21,019 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:21,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash -814878683, now seen corresponding path program 1 times [2024-09-11 20:11:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024846733] [2024-09-11 20:11:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236615788] [2024-09-11 20:11:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:21,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:21,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:21,037 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 20:11:21,038 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 20:11:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:21,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-11 20:11:21,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-11 20:11:21,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-11 20:11:21,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:21,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024846733] [2024-09-11 20:11:21,833 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:21,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236615788] [2024-09-11 20:11:21,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236615788] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:21,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:11:21,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2024-09-11 20:11:21,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223969299] [2024-09-11 20:11:21,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:21,833 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:11:21,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:21,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:11:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:11:21,834 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 11 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2024-09-11 20:11:22,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:22,321 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2024-09-11 20:11:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-11 20:11:22,322 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 11 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 66 [2024-09-11 20:11:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:22,323 INFO L225 Difference]: With dead ends: 170 [2024-09-11 20:11:22,323 INFO L226 Difference]: Without dead ends: 125 [2024-09-11 20:11:22,324 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:11:22,325 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:22,325 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 174 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:11:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-09-11 20:11:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 100. [2024-09-11 20:11:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 65 states have internal predecessors, (71), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-11 20:11:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2024-09-11 20:11:22,350 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 66 [2024-09-11 20:11:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:22,351 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2024-09-11 20:11:22,351 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 11 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2024-09-11 20:11:22,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2024-09-11 20:11:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-09-11 20:11:22,352 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:22,352 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:22,366 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 20:11:22,558 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:22,559 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:22,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1399001704, now seen corresponding path program 1 times [2024-09-11 20:11:22,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:22,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917880437] [2024-09-11 20:11:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,888 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:11:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:11:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,939 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:11:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,945 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-11 20:11:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-11 20:11:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-11 20:11:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 20:11:22,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:22,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917880437] [2024-09-11 20:11:22,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917880437] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761539812] [2024-09-11 20:11:22,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:22,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:22,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:22,956 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 20:11:22,957 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 20:11:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-11 20:11:23,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 20:11:23,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 20:11:23,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761539812] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:23,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:11:23,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-09-11 20:11:23,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863347701] [2024-09-11 20:11:23,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:23,397 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 20:11:23,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:23,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 20:11:23,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:11:23,398 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-09-11 20:11:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:23,552 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2024-09-11 20:11:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:11:23,552 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 71 [2024-09-11 20:11:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:23,553 INFO L225 Difference]: With dead ends: 119 [2024-09-11 20:11:23,553 INFO L226 Difference]: Without dead ends: 92 [2024-09-11 20:11:23,554 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:11:23,554 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:23,554 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 198 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:11:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-11 20:11:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-09-11 20:11:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 60 states have internal predecessors, (64), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-11 20:11:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2024-09-11 20:11:23,595 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 71 [2024-09-11 20:11:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:23,596 INFO L474 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2024-09-11 20:11:23,596 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-09-11 20:11:23,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2024-09-11 20:11:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-11 20:11:23,599 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:23,599 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:23,615 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 20:11:23,800 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-11 20:11:23,800 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:23,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2065528550, now seen corresponding path program 1 times [2024-09-11 20:11:23,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:23,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544422781] [2024-09-11 20:11:23,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,926 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,930 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:11:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:11:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,936 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:11:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 20:11:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:11:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 20:11:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 20:11:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-11 20:11:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-09-11 20:11:23,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:23,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544422781] [2024-09-11 20:11:23,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544422781] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:23,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045517215] [2024-09-11 20:11:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:23,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:23,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:23,962 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:23,963 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 20:11:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:11:24,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-09-11 20:11:24,101 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:11:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045517215] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:24,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:11:24,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2024-09-11 20:11:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122906960] [2024-09-11 20:11:24,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:24,102 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:11:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:24,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:11:24,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:11:24,103 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-11 20:11:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:24,171 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2024-09-11 20:11:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:11:24,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 85 [2024-09-11 20:11:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:24,172 INFO L225 Difference]: With dead ends: 124 [2024-09-11 20:11:24,173 INFO L226 Difference]: Without dead ends: 87 [2024-09-11 20:11:24,173 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:11:24,173 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:24,174 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 111 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:11:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-11 20:11:24,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2024-09-11 20:11:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 51 states have internal predecessors, (53), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-11 20:11:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-09-11 20:11:24,188 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 85 [2024-09-11 20:11:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:24,189 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-09-11 20:11:24,189 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-11 20:11:24,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-09-11 20:11:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-11 20:11:24,190 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:24,190 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:24,204 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 20:11:24,390 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:24,391 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:24,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash -376584808, now seen corresponding path program 2 times [2024-09-11 20:11:24,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:24,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579278224] [2024-09-11 20:11:24,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:11:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,691 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:11:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:11:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 20:11:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:11:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 20:11:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 20:11:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-11 20:11:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-11 20:11:24,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:24,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579278224] [2024-09-11 20:11:24,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579278224] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:24,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544910359] [2024-09-11 20:11:24,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:11:24,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:24,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:24,715 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:24,716 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-11 20:11:24,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:11:24,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:11:24,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-11 20:11:24,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-11 20:11:24,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-11 20:11:25,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544910359] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:25,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:11:25,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2024-09-11 20:11:25,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239264476] [2024-09-11 20:11:25,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:25,570 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 20:11:25,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 20:11:25,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:11:25,572 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 13 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2024-09-11 20:11:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:25,795 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2024-09-11 20:11:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:11:25,795 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 13 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) Word has length 85 [2024-09-11 20:11:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:25,796 INFO L225 Difference]: With dead ends: 125 [2024-09-11 20:11:25,796 INFO L226 Difference]: Without dead ends: 76 [2024-09-11 20:11:25,797 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2024-09-11 20:11:25,797 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:25,797 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 401 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:11:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-11 20:11:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-09-11 20:11:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 49 states have internal predecessors, (49), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-11 20:11:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-09-11 20:11:25,813 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 85 [2024-09-11 20:11:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:25,814 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-09-11 20:11:25,814 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 13 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2024-09-11 20:11:25,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-09-11 20:11:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-11 20:11:25,815 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:25,815 INFO L216 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:25,827 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-11 20:11:26,018 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:26,018 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:26,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1944501767, now seen corresponding path program 2 times [2024-09-11 20:11:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:26,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921194082] [2024-09-11 20:11:26,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:26,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953637281] [2024-09-11 20:11:26,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:11:26,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:26,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:26,035 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:26,036 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-11 20:11:26,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:11:26,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:11:26,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-11 20:11:26,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 48 proven. 45 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-09-11 20:11:26,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 48 proven. 45 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-09-11 20:11:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921194082] [2024-09-11 20:11:46,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953637281] [2024-09-11 20:11:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953637281] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:46,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:11:46,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2024-09-11 20:11:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755677425] [2024-09-11 20:11:46,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:46,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:11:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:11:46,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:11:46,478 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 12 states have call predecessors, (28), 12 states have call successors, (28) [2024-09-11 20:11:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:46,792 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2024-09-11 20:11:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 20:11:46,793 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 12 states have call predecessors, (28), 12 states have call successors, (28) Word has length 90 [2024-09-11 20:11:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:46,793 INFO L225 Difference]: With dead ends: 86 [2024-09-11 20:11:46,793 INFO L226 Difference]: Without dead ends: 84 [2024-09-11 20:11:46,794 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:11:46,794 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:46,794 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 243 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:11:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-11 20:11:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-09-11 20:11:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 55 states have internal predecessors, (55), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-11 20:11:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-09-11 20:11:46,809 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 90 [2024-09-11 20:11:46,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:46,811 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-09-11 20:11:46,811 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 12 states have call predecessors, (28), 12 states have call successors, (28) [2024-09-11 20:11:46,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-09-11 20:11:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-09-11 20:11:46,812 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:46,812 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:46,825 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-11 20:11:47,013 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-11 20:11:47,014 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:47,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1552559470, now seen corresponding path program 1 times [2024-09-11 20:11:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681228114] [2024-09-11 20:11:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:47,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890670723] [2024-09-11 20:11:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:47,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:47,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:47,036 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:47,036 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-11 20:11:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:47,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-11 20:11:47,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-11 20:11:47,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:47,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:47,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681228114] [2024-09-11 20:11:47,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:47,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890670723] [2024-09-11 20:11:47,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890670723] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:47,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:11:47,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-09-11 20:11:47,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350882546] [2024-09-11 20:11:47,908 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:47,908 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 20:11:47,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:47,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 20:11:47,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:11:47,909 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-11 20:11:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:48,082 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2024-09-11 20:11:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:11:48,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 96 [2024-09-11 20:11:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:48,083 INFO L225 Difference]: With dead ends: 90 [2024-09-11 20:11:48,084 INFO L226 Difference]: Without dead ends: 86 [2024-09-11 20:11:48,084 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:11:48,084 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:48,084 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 258 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:11:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-11 20:11:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-09-11 20:11:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.0) internal successors, (56), 56 states have internal predecessors, (56), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-11 20:11:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2024-09-11 20:11:48,098 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 96 [2024-09-11 20:11:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:48,098 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2024-09-11 20:11:48,098 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-11 20:11:48,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2024-09-11 20:11:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-09-11 20:11:48,099 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:48,099 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:48,111 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-11 20:11:48,299 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-11 20:11:48,300 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:48,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2060413457, now seen corresponding path program 1 times [2024-09-11 20:11:48,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:48,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977974900] [2024-09-11 20:11:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:11:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,538 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:11:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:11:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 20:11:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,545 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:11:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,547 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 20:11:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 20:11:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-11 20:11:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-11 20:11:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-11 20:11:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-11 20:11:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-11 20:11:48,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:48,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977974900] [2024-09-11 20:11:48,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977974900] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:48,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714611169] [2024-09-11 20:11:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:48,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:48,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:48,561 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:48,562 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-11 20:11:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:48,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-11 20:11:48,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-09-11 20:11:48,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-09-11 20:11:50,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714611169] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:50,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:11:50,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 14] total 30 [2024-09-11 20:11:50,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615062143] [2024-09-11 20:11:50,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:50,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-11 20:11:50,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:50,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-11 20:11:50,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2024-09-11 20:11:50,246 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 27 states have internal predecessors, (60), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2024-09-11 20:11:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:50,492 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2024-09-11 20:11:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:11:50,492 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 27 states have internal predecessors, (60), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) Word has length 101 [2024-09-11 20:11:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:50,493 INFO L225 Difference]: With dead ends: 90 [2024-09-11 20:11:50,493 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:11:50,493 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2024-09-11 20:11:50,494 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:50,494 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 362 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:11:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:11:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:11:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:11:50,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2024-09-11 20:11:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:50,494 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:11:50,494 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 27 states have internal predecessors, (60), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2024-09-11 20:11:50,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:11:50,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:11:50,497 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:11:50,510 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-11 20:11:50,698 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-11 20:11:50,700 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:50,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:11:51,244 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:11:51,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:11:51 BoogieIcfgContainer [2024-09-11 20:11:51,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:11:51,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:11:51,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:11:51,256 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:11:51,256 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:11:15" (3/4) ... [2024-09-11 20:11:51,257 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:11:51,260 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 20:11:51,262 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-09-11 20:11:51,262 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-09-11 20:11:51,263 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 20:11:51,263 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:11:51,263 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:11:51,333 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:11:51,334 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:11:51,334 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:11:51,334 INFO L158 Benchmark]: Toolchain (without parser) took 36604.75ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 136.2MB in the beginning and 215.2MB in the end (delta: -79.0MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-09-11 20:11:51,334 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:11:51,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.54ms. Allocated memory is still 178.3MB. Free memory was 135.9MB in the beginning and 123.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:11:51,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.72ms. Allocated memory is still 178.3MB. Free memory was 123.7MB in the beginning and 122.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:11:51,335 INFO L158 Benchmark]: Boogie Preprocessor took 35.97ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 120.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:11:51,335 INFO L158 Benchmark]: RCFGBuilder took 298.01ms. Allocated memory is still 178.3MB. Free memory was 120.3MB in the beginning and 108.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:11:51,335 INFO L158 Benchmark]: TraceAbstraction took 35989.08ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 107.8MB in the beginning and 220.4MB in the end (delta: -112.7MB). Peak memory consumption was 145.1MB. Max. memory is 16.1GB. [2024-09-11 20:11:51,336 INFO L158 Benchmark]: Witness Printer took 77.87ms. Allocated memory is still 310.4MB. Free memory was 220.4MB in the beginning and 215.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:11:51,337 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.54ms. Allocated memory is still 178.3MB. Free memory was 135.9MB in the beginning and 123.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.72ms. Allocated memory is still 178.3MB. Free memory was 123.7MB in the beginning and 122.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.97ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 120.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 298.01ms. Allocated memory is still 178.3MB. Free memory was 120.3MB in the beginning and 108.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 35989.08ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 107.8MB in the beginning and 220.4MB in the end (delta: -112.7MB). Peak memory consumption was 145.1MB. Max. memory is 16.1GB. * Witness Printer took 77.87ms. Allocated memory is still 310.4MB. Free memory was 220.4MB in the beginning and 215.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.4s, OverallIterations: 15, TraceHistogramMax: 17, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 2438 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2033 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2336 IncrementalHoareTripleChecker+Invalid, 2558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 405 mSDtfsCounter, 2336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1467 GetRequests, 1271 SyntacticMatches, 6 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=8, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 1524 NumberOfCodeBlocks, 1524 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1640 ConstructedInterpolants, 0 QuantifiedInterpolants, 18523 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1909 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 27 InterpolantComputations, 7 PerfectInterpolantSequences, 5854/6411 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((((((((((d == 1) && (p == 1)) && (q == 0)) && (A == r)) && (B == 1)) || ((((((2 == A) && (2 == p)) && (r == 0)) && (2 == q)) && (B == 1)) && (2 == d))) || ((((((d == 1) && (p == 1)) && (2 == A)) && (r == 0)) && (2 == q)) && (B == 1))) || ((((((p == 4) && (2 == A)) && (q == 0)) && (d == 4)) && (2 == r)) && (B == 1))) || ((((((2 == p) && (q == 0)) && (A == 1)) && (r == 1)) && (B == 1)) && (2 == d))) || ((((((d == 1) && (p == 1)) && (r == 0)) && (q == 1)) && (A == 1)) && (B == 1))) - InvariantResult [Line: 59]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((2 == p) && (q == 0)) && (A <= 2)) && (A == r)) && (1 <= r)) && (B == 1)) && (2 == d)) || (((((((d == 1) && (p == 1)) && (q == 0)) && (A <= 2)) && (A == r)) && (B == 1)) && (0 <= A))) || ((((((p == 4) && (q == 0)) && (A == r)) && (d == 4)) && (2 == r)) && (B == 1))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:11:51,372 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE