./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound5.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_valuebound5.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 a077c1334c11d8329da2d0c58ca917b2036581fa7e949d1d304e3346ec54a811 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:57:22,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:57:22,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:57:22,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:57:22,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:57:22,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:57:22,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:57:22,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:57:22,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:57:22,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:57:22,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:57:22,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:57:22,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:57:22,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:57:22,650 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:57:22,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:57:22,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:57:22,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:57:22,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:57:22,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:57:22,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:57:22,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:57:22,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:57:22,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:57:22,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:57:22,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:57:22,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:57:22,654 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:57:22,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:57:22,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:57:22,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:57:22,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:57:22,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:57:22,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:57:22,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:57:22,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:57:22,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:57:22,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:57:22,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:57:22,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:57:22,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:57:22,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:57:22,659 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 -> a077c1334c11d8329da2d0c58ca917b2036581fa7e949d1d304e3346ec54a811 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:57:22,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:57:22,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:57:22,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:57:22,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:57:22,976 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:57:22,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound5.c [2024-10-15 14:57:24,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:57:24,594 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:57:24,594 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound5.c [2024-10-15 14:57:24,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6ce518a4c/cbcefb5be2b14a109f5d99a1d154336c/FLAG9668d170c [2024-10-15 14:57:24,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6ce518a4c/cbcefb5be2b14a109f5d99a1d154336c [2024-10-15 14:57:24,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:57:24,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:57:24,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:57:24,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:57:24,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:57:24,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0cfedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24, skipping insertion in model container [2024-10-15 14:57:24,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:57:24,829 WARN L248 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_valuebound5.c[526,539] [2024-10-15 14:57:24,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:57:24,850 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:57:24,862 WARN L248 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_valuebound5.c[526,539] [2024-10-15 14:57:24,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:57:24,880 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:57:24,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24 WrapperNode [2024-10-15 14:57:24,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:57:24,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:57:24,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:57:24,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:57:24,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,902 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:57:24,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:57:24,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:57:24,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:57:24,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:57:24,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,938 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-10-15 14:57:24,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:57:24,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:57:24,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:57:24,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:57:24,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (1/1) ... [2024-10-15 14:57:24,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:57:24,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:24,995 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-10-15 14:57:24,998 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-10-15 14:57:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:57:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:57:25,045 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:57:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:57:25,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:57:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:57:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 14:57:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:57:25,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:57:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:57:25,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:57:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:57:25,048 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:57:25,112 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:57:25,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:57:25,287 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:57:25,288 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:57:25,315 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:57:25,315 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:57:25,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:25 BoogieIcfgContainer [2024-10-15 14:57:25,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:57:25,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:57:25,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:57:25,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:57:25,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:57:24" (1/3) ... [2024-10-15 14:57:25,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e2d7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:57:25, skipping insertion in model container [2024-10-15 14:57:25,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:24" (2/3) ... [2024-10-15 14:57:25,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e2d7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:57:25, skipping insertion in model container [2024-10-15 14:57:25,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:25" (3/3) ... [2024-10-15 14:57:25,331 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound5.c [2024-10-15 14:57:25,347 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:57:25,347 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:57:25,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:57:25,414 INFO L333 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;@7d7dfe8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:57:25,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:57:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:57:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:57:25,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:25,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:25,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:25,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:25,431 INFO L85 PathProgramCache]: Analyzing trace with hash -909137831, now seen corresponding path program 1 times [2024-10-15 14:57:25,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:25,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425105665] [2024-10-15 14:57:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:25,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:25,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:57:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425105665] [2024-10-15 14:57:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425105665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:25,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:25,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:57:25,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816262565] [2024-10-15 14:57:25,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:25,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:57:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:25,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:57:25,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:57:25,649 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:57:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:25,684 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2024-10-15 14:57:25,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:57:25,688 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-15 14:57:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:25,695 INFO L225 Difference]: With dead ends: 58 [2024-10-15 14:57:25,695 INFO L226 Difference]: Without dead ends: 29 [2024-10-15 14:57:25,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-10-15 14:57:25,702 INFO L432 NwaCegarLoop]: 39 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, 39 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-10-15 14:57:25,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-15 14:57:25,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-15 14:57:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 14:57:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-10-15 14:57:25,733 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-10-15 14:57:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:25,734 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-15 14:57:25,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:57:25,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-10-15 14:57:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:57:25,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:25,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:25,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:57:25,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash -229079461, now seen corresponding path program 1 times [2024-10-15 14:57:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:25,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156589622] [2024-10-15 14:57:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:57:25,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:25,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156589622] [2024-10-15 14:57:25,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156589622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:25,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:25,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:25,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3778891] [2024-10-15 14:57:25,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:25,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:25,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:25,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:25,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:25,937 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:57:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:26,010 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-10-15 14:57:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:26,011 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-15 14:57:26,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:26,012 INFO L225 Difference]: With dead ends: 42 [2024-10-15 14:57:26,013 INFO L226 Difference]: Without dead ends: 40 [2024-10-15 14:57:26,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-10-15 14:57:26,015 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:26,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-15 14:57:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-10-15 14:57:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 14:57:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-10-15 14:57:26,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 16 [2024-10-15 14:57:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:26,036 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-15 14:57:26,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:57:26,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-10-15 14:57:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:57:26,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:26,037 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:26,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:57:26,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:26,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash 520476838, now seen corresponding path program 1 times [2024-10-15 14:57:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:26,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243594272] [2024-10-15 14:57:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:57:26,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:26,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243594272] [2024-10-15 14:57:26,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243594272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:26,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:26,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:26,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880492691] [2024-10-15 14:57:26,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:26,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:26,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:26,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:26,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:26,237 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:57:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:26,294 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-10-15 14:57:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:26,295 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-15 14:57:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:26,296 INFO L225 Difference]: With dead ends: 46 [2024-10-15 14:57:26,297 INFO L226 Difference]: Without dead ends: 44 [2024-10-15 14:57:26,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-10-15 14:57:26,299 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:26,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-15 14:57:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-10-15 14:57:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 14:57:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-15 14:57:26,313 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2024-10-15 14:57:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:26,313 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-15 14:57:26,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:57:26,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-15 14:57:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-15 14:57:26,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:26,315 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:26,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:57:26,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:26,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1140086011, now seen corresponding path program 1 times [2024-10-15 14:57:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46020137] [2024-10-15 14:57:26,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:26,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1113610768] [2024-10-15 14:57:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:26,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:26,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:26,345 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-10-15 14:57:26,347 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:57:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:26,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 14:57:26,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:57:26,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:57:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:26,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46020137] [2024-10-15 14:57:26,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:26,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113610768] [2024-10-15 14:57:26,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113610768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:26,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:26,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973203681] [2024-10-15 14:57:26,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:26,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:26,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:26,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:26,520 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:57:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:26,606 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-10-15 14:57:26,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:26,607 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-10-15 14:57:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:26,608 INFO L225 Difference]: With dead ends: 63 [2024-10-15 14:57:26,608 INFO L226 Difference]: Without dead ends: 50 [2024-10-15 14:57:26,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-10-15 14:57:26,612 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:26,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:57:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-15 14:57:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-15 14:57:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-15 14:57:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-10-15 14:57:26,630 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 26 [2024-10-15 14:57:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:26,631 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-10-15 14:57:26,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:57:26,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-10-15 14:57:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-15 14:57:26,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:26,632 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:26,650 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:57:26,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:26,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:26,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash -975701997, now seen corresponding path program 1 times [2024-10-15 14:57:26,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:26,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350261154] [2024-10-15 14:57:26,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:26,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1195997144] [2024-10-15 14:57:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:26,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:26,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:26,855 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-10-15 14:57:26,860 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:57:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:26,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:57:26,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:57:26,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:57:26,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350261154] [2024-10-15 14:57:26,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195997144] [2024-10-15 14:57:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195997144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:26,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:26,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:26,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497090870] [2024-10-15 14:57:26,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:26,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:26,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:26,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:26,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:26,986 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:57:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:27,053 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-10-15 14:57:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:27,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-10-15 14:57:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:27,055 INFO L225 Difference]: With dead ends: 63 [2024-10-15 14:57:27,055 INFO L226 Difference]: Without dead ends: 61 [2024-10-15 14:57:27,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-10-15 14:57:27,056 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:27,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-15 14:57:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-10-15 14:57:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-15 14:57:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-10-15 14:57:27,081 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 33 [2024-10-15 14:57:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:27,082 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-10-15 14:57:27,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:57:27,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-10-15 14:57:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-15 14:57:27,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:27,084 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:27,101 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 14:57:27,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:27,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:27,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -928833564, now seen corresponding path program 1 times [2024-10-15 14:57:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544465837] [2024-10-15 14:57:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:27,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:27,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084329535] [2024-10-15 14:57:27,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:27,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:27,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:27,318 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-10-15 14:57:27,320 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:57:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:27,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 14:57:27,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-15 14:57:27,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-15 14:57:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544465837] [2024-10-15 14:57:27,601 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084329535] [2024-10-15 14:57:27,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084329535] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:57:27,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:57:27,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-15 14:57:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520845667] [2024-10-15 14:57:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:27,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:27,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:27,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:27,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:57:27,603 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:57:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:27,674 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-10-15 14:57:27,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:27,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2024-10-15 14:57:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:27,677 INFO L225 Difference]: With dead ends: 70 [2024-10-15 14:57:27,678 INFO L226 Difference]: Without dead ends: 68 [2024-10-15 14:57:27,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 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-10-15 14:57:27,679 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:27,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-15 14:57:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-10-15 14:57:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-15 14:57:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2024-10-15 14:57:27,714 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 43 [2024-10-15 14:57:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:27,715 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2024-10-15 14:57:27,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:57:27,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-10-15 14:57:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-15 14:57:27,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:27,719 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:27,735 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 14:57:27,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-15 14:57:27,924 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:27,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash -238148106, now seen corresponding path program 1 times [2024-10-15 14:57:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:27,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653083765] [2024-10-15 14:57:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:27,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:28,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:57:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:28,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:57:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:28,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:57:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:28,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:57:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:57:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-15 14:57:28,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653083765] [2024-10-15 14:57:28,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653083765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:28,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879350795] [2024-10-15 14:57:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:28,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:28,067 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-15 14:57:28,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:28,122 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2024-10-15 14:57:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:28,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2024-10-15 14:57:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:28,124 INFO L225 Difference]: With dead ends: 75 [2024-10-15 14:57:28,125 INFO L226 Difference]: Without dead ends: 63 [2024-10-15 14:57:28,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10-15 14:57:28,126 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:28,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 123 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-15 14:57:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-15 14:57:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-15 14:57:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2024-10-15 14:57:28,150 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 49 [2024-10-15 14:57:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:28,150 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2024-10-15 14:57:28,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-15 14:57:28,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2024-10-15 14:57:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-15 14:57:28,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:28,155 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:28,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:57:28,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:28,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:28,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1374799408, now seen corresponding path program 1 times [2024-10-15 14:57:28,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:28,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852954823] [2024-10-15 14:57:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:28,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285948489] [2024-10-15 14:57:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:28,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:28,200 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-10-15 14:57:28,203 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:57:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:28,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-15 14:57:28,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-15 14:57:28,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-15 14:57:30,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:30,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852954823] [2024-10-15 14:57:30,017 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:30,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285948489] [2024-10-15 14:57:30,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285948489] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:30,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:57:30,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-15 14:57:30,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70674348] [2024-10-15 14:57:30,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:30,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 14:57:30,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:30,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 14:57:30,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:57:30,019 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-15 14:57:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:30,668 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2024-10-15 14:57:30,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 14:57:30,669 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 63 [2024-10-15 14:57:30,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:30,671 INFO L225 Difference]: With dead ends: 138 [2024-10-15 14:57:30,671 INFO L226 Difference]: Without dead ends: 115 [2024-10-15 14:57:30,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-10-15 14:57:30,673 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:30,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 225 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:57:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-15 14:57:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-10-15 14:57:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 71 states have internal predecessors, (80), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-15 14:57:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2024-10-15 14:57:30,718 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 63 [2024-10-15 14:57:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:30,719 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2024-10-15 14:57:30,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-15 14:57:30,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2024-10-15 14:57:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-15 14:57:30,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:30,723 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:30,740 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 14:57:30,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:30,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:30,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2048390162, now seen corresponding path program 1 times [2024-10-15 14:57:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:30,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177425721] [2024-10-15 14:57:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:30,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:30,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352496402] [2024-10-15 14:57:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:30,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:30,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:30,958 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-10-15 14:57:30,960 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:57:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:31,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-15 14:57:31,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 14:57:31,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 14:57:31,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177425721] [2024-10-15 14:57:31,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352496402] [2024-10-15 14:57:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352496402] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:31,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:57:31,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-10-15 14:57:31,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532646586] [2024-10-15 14:57:31,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:31,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-15 14:57:31,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:31,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 14:57:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-10-15 14:57:31,802 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-15 14:57:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:32,477 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2024-10-15 14:57:32,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 14:57:32,478 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 74 [2024-10-15 14:57:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:32,480 INFO L225 Difference]: With dead ends: 168 [2024-10-15 14:57:32,480 INFO L226 Difference]: Without dead ends: 136 [2024-10-15 14:57:32,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-10-15 14:57:32,481 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:32,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 195 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:57:32,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-15 14:57:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2024-10-15 14:57:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 70 states have internal predecessors, (76), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-15 14:57:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-10-15 14:57:32,516 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 74 [2024-10-15 14:57:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-10-15 14:57:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-15 14:57:32,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-10-15 14:57:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-15 14:57:32,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:32,519 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:32,533 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 14:57:32,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:32,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:32,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1556827571, now seen corresponding path program 1 times [2024-10-15 14:57:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170144491] [2024-10-15 14:57:32,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:32,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:32,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:57:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:32,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:57:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:57:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:57:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:57:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:57:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:33,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:57:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:33,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:57:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:33,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:57:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:33,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:57:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-15 14:57:33,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:33,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170144491] [2024-10-15 14:57:33,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170144491] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:57:33,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217153828] [2024-10-15 14:57:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:33,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:33,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:33,028 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-10-15 14:57:33,029 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:57:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:33,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-15 14:57:33,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-15 14:57:33,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-15 14:57:33,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217153828] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:33,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:57:33,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-15 14:57:33,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264188134] [2024-10-15 14:57:33,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:33,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-15 14:57:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:33,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 14:57:33,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:57:33,584 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-15 14:57:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:33,797 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2024-10-15 14:57:33,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 14:57:33,797 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) Word has length 79 [2024-10-15 14:57:33,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:33,799 INFO L225 Difference]: With dead ends: 129 [2024-10-15 14:57:33,799 INFO L226 Difference]: Without dead ends: 100 [2024-10-15 14:57:33,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:57:33,803 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:33,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 225 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:57:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-15 14:57:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-15 14:57:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-15 14:57:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2024-10-15 14:57:33,831 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 79 [2024-10-15 14:57:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:33,832 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2024-10-15 14:57:33,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-15 14:57:33,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2024-10-15 14:57:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-15 14:57:33,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:33,834 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:33,850 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-15 14:57:34,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-15 14:57:34,038 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:34,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:34,038 INFO L85 PathProgramCache]: Analyzing trace with hash -802122381, now seen corresponding path program 2 times [2024-10-15 14:57:34,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:34,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271338793] [2024-10-15 14:57:34,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:34,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:34,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081685805] [2024-10-15 14:57:34,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:57:34,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:34,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:34,084 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-10-15 14:57:34,085 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-15 14:57:34,147 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:57:34,148 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:57:34,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-15 14:57:34,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-15 14:57:34,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-15 14:57:50,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:50,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271338793] [2024-10-15 14:57:50,543 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081685805] [2024-10-15 14:57:50,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081685805] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:50,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:57:50,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2024-10-15 14:57:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865094852] [2024-10-15 14:57:50,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:50,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-15 14:57:50,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:50,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-15 14:57:50,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-15 14:57:50,547 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-15 14:58:03,242 WARN L286 SmtUtils]: Spent 12.26s on a formula simplification. DAG size of input: 171 DAG size of output: 83 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:58:04,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:58:06,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:58:23,272 WARN L286 SmtUtils]: Spent 11.24s on a formula simplification. DAG size of input: 156 DAG size of output: 91 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:58:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:24,336 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2024-10-15 14:58:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-15 14:58:24,337 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 93 [2024-10-15 14:58:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:24,339 INFO L225 Difference]: With dead ends: 203 [2024-10-15 14:58:24,339 INFO L226 Difference]: Without dead ends: 170 [2024-10-15 14:58:24,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:58:24,340 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 66 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:24,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 513 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-10-15 14:58:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-15 14:58:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2024-10-15 14:58:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 98 states have (on average 1.183673469387755) internal successors, (116), 105 states have internal predecessors, (116), 51 states have call successors, (51), 17 states have call predecessors, (51), 16 states have return successors, (49), 43 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-15 14:58:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2024-10-15 14:58:24,405 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 93 [2024-10-15 14:58:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:24,406 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2024-10-15 14:58:24,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-15 14:58:24,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2024-10-15 14:58:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-15 14:58:24,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:58:24,408 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:24,424 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-15 14:58:24,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:24,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:58:24,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash 644553835, now seen corresponding path program 2 times [2024-10-15 14:58:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:58:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056259335] [2024-10-15 14:58:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:24,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:58:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:58:24,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165902867] [2024-10-15 14:58:24,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:58:24,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:24,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:58:24,649 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-10-15 14:58:24,650 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 14:58:24,711 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:58:24,711 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:58:24,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-15 14:58:24,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:58:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-15 14:58:25,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:58:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-15 14:58:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:58:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056259335] [2024-10-15 14:58:28,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:58:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165902867] [2024-10-15 14:58:28,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165902867] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:58:28,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:58:28,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-10-15 14:58:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596444447] [2024-10-15 14:58:28,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:58:28,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-15 14:58:28,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:58:28,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-15 14:58:28,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2024-10-15 14:58:28,228 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 27 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 16 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) [2024-10-15 14:58:32,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:58:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:32,869 INFO L93 Difference]: Finished difference Result 246 states and 327 transitions. [2024-10-15 14:58:32,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-15 14:58:32,869 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 16 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) Word has length 104 [2024-10-15 14:58:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:32,871 INFO L225 Difference]: With dead ends: 246 [2024-10-15 14:58:32,872 INFO L226 Difference]: Without dead ends: 185 [2024-10-15 14:58:32,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2024-10-15 14:58:32,873 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:32,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 422 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-15 14:58:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-15 14:58:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 161. [2024-10-15 14:58:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 103 states have internal predecessors, (112), 47 states have call successors, (47), 18 states have call predecessors, (47), 17 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-15 14:58:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 204 transitions. [2024-10-15 14:58:32,950 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 204 transitions. Word has length 104 [2024-10-15 14:58:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:32,950 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 204 transitions. [2024-10-15 14:58:32,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 16 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) [2024-10-15 14:58:32,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2024-10-15 14:58:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-15 14:58:32,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:58:32,952 INFO L215 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:32,968 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-15 14:58:33,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:33,153 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:58:33,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1191181482, now seen corresponding path program 2 times [2024-10-15 14:58:33,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:58:33,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647673457] [2024-10-15 14:58:33,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:58:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:58:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:58:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:58:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:58:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:58:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:58:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:58:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:58:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:58:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:58:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-15 14:58:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:58:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-15 14:58:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:58:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-15 14:58:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-15 14:58:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-15 14:58:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-15 14:58:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-15 14:58:33,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:58:33,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647673457] [2024-10-15 14:58:33,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647673457] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:58:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651960473] [2024-10-15 14:58:33,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:58:33,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:33,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:58:33,595 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-10-15 14:58:33,597 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-15 14:58:33,661 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:58:33,662 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:58:33,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-15 14:58:33,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:58:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-15 14:58:33,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:58:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-15 14:58:34,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651960473] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:58:34,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:58:34,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 25 [2024-10-15 14:58:34,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58090898] [2024-10-15 14:58:34,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:58:34,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-15 14:58:34,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:58:34,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-15 14:58:34,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2024-10-15 14:58:34,999 INFO L87 Difference]: Start difference. First operand 161 states and 204 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 18 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 18 states have call predecessors, (49), 18 states have call successors, (49) [2024-10-15 14:58:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:35,397 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2024-10-15 14:58:35,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:58:35,397 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 18 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 18 states have call predecessors, (49), 18 states have call successors, (49) Word has length 109 [2024-10-15 14:58:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:35,399 INFO L225 Difference]: With dead ends: 187 [2024-10-15 14:58:35,399 INFO L226 Difference]: Without dead ends: 145 [2024-10-15 14:58:35,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:58:35,400 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:35,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 334 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:58:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-15 14:58:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2024-10-15 14:58:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 89 states have internal predecessors, (96), 38 states have call successors, (38), 17 states have call predecessors, (38), 16 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-15 14:58:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2024-10-15 14:58:35,465 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 109 [2024-10-15 14:58:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:35,466 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2024-10-15 14:58:35,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 18 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 18 states have call predecessors, (49), 18 states have call successors, (49) [2024-10-15 14:58:35,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2024-10-15 14:58:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-15 14:58:35,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:58:35,474 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:35,491 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-15 14:58:35,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-15 14:58:35,675 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:58:35,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash -626389098, now seen corresponding path program 1 times [2024-10-15 14:58:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:58:35,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304623915] [2024-10-15 14:58:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:35,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:58:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:58:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:58:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:58:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:58:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:58:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:58:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:58:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:58:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:58:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:58:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-15 14:58:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:58:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-15 14:58:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-15 14:58:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-15 14:58:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-15 14:58:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-15 14:58:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-15 14:58:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-15 14:58:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-15 14:58:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 51 proven. 28 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-15 14:58:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:58:35,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304623915] [2024-10-15 14:58:35,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304623915] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:58:35,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041980390] [2024-10-15 14:58:35,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:35,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:35,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:58:35,885 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-10-15 14:58:35,887 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-15 14:58:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:35,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:58:35,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:58:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-15 14:58:36,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:58:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-15 14:58:36,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041980390] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:58:36,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:58:36,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 9 [2024-10-15 14:58:36,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245664138] [2024-10-15 14:58:36,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:58:36,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:58:36,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:58:36,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:58:36,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:58:36,177 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 9 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) [2024-10-15 14:58:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:36,341 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2024-10-15 14:58:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:58:36,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 9 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) Word has length 121 [2024-10-15 14:58:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:36,343 INFO L225 Difference]: With dead ends: 155 [2024-10-15 14:58:36,343 INFO L226 Difference]: Without dead ends: 148 [2024-10-15 14:58:36,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 276 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:58:36,344 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:36,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 185 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:58:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-15 14:58:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-10-15 14:58:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 93 states have internal predecessors, (100), 42 states have call successors, (42), 17 states have call predecessors, (42), 16 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-15 14:58:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 182 transitions. [2024-10-15 14:58:36,435 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 182 transitions. Word has length 121 [2024-10-15 14:58:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:36,436 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 182 transitions. [2024-10-15 14:58:36,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 9 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) [2024-10-15 14:58:36,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 182 transitions. [2024-10-15 14:58:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-15 14:58:36,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:58:36,439 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:36,456 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-15 14:58:36,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-15 14:58:36,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:58:36,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1967500462, now seen corresponding path program 1 times [2024-10-15 14:58:36,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:58:36,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969992649] [2024-10-15 14:58:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:58:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:58:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:58:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:58:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:58:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:58:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:58:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:58:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:58:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:58:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:58:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-15 14:58:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:58:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-15 14:58:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-15 14:58:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-15 14:58:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-15 14:58:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-15 14:58:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-15 14:58:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-15 14:58:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-15 14:58:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-10-15 14:58:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:58:36,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969992649] [2024-10-15 14:58:36,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969992649] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:58:36,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415275843] [2024-10-15 14:58:36,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:36,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:36,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:58:36,867 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-10-15 14:58:36,869 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-15 14:58:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:36,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 14:58:36,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:58:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-10-15 14:58:37,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:58:37,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415275843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:58:37,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:58:37,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-10-15 14:58:37,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999151795] [2024-10-15 14:58:37,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:58:37,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:58:37,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:58:37,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:58:37,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:58:37,075 INFO L87 Difference]: Start difference. First operand 147 states and 182 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-15 14:58:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:37,259 INFO L93 Difference]: Finished difference Result 190 states and 238 transitions. [2024-10-15 14:58:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:58:37,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 123 [2024-10-15 14:58:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:37,261 INFO L225 Difference]: With dead ends: 190 [2024-10-15 14:58:37,262 INFO L226 Difference]: Without dead ends: 147 [2024-10-15 14:58:37,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:58:37,263 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:37,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 125 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:58:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-15 14:58:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2024-10-15 14:58:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 83 states have internal predecessors, (88), 34 states have call successors, (34), 17 states have call predecessors, (34), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-15 14:58:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2024-10-15 14:58:37,349 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 123 [2024-10-15 14:58:37,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:37,349 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2024-10-15 14:58:37,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-15 14:58:37,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2024-10-15 14:58:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-15 14:58:37,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:58:37,351 INFO L215 NwaCegarLoop]: trace histogram [21, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:37,367 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-15 14:58:37,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-15 14:58:37,556 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:58:37,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:37,556 INFO L85 PathProgramCache]: Analyzing trace with hash -478157618, now seen corresponding path program 3 times [2024-10-15 14:58:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:58:37,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085430555] [2024-10-15 14:58:37,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:37,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:58:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:58:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:58:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:58:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:58:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:58:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:58:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:58:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:58:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:58:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:58:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-15 14:58:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:58:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-15 14:58:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-15 14:58:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-15 14:58:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-15 14:58:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-15 14:58:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-15 14:58:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-15 14:58:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-15 14:58:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-15 14:58:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-15 14:58:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 52 proven. 45 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-15 14:58:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:58:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085430555] [2024-10-15 14:58:38,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085430555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:58:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822486642] [2024-10-15 14:58:38,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:58:38,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:38,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:58:38,175 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:58:38,177 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-15 14:58:38,251 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-15 14:58:38,251 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:58:38,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-15 14:58:38,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:58:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 163 proven. 53 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2024-10-15 14:58:38,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:58:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-15 14:58:38,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822486642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:58:38,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:58:38,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 28 [2024-10-15 14:58:38,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168562866] [2024-10-15 14:58:38,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:58:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-15 14:58:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:58:38,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-15 14:58:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:58:38,605 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 28 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 22 states have internal predecessors, (61), 14 states have call successors, (41), 4 states have call predecessors, (41), 3 states have return successors, (41), 15 states have call predecessors, (41), 12 states have call successors, (41) [2024-10-15 14:58:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:39,291 INFO L93 Difference]: Finished difference Result 188 states and 224 transitions. [2024-10-15 14:58:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-15 14:58:39,292 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 22 states have internal predecessors, (61), 14 states have call successors, (41), 4 states have call predecessors, (41), 3 states have return successors, (41), 15 states have call predecessors, (41), 12 states have call successors, (41) Word has length 134 [2024-10-15 14:58:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:39,293 INFO L225 Difference]: With dead ends: 188 [2024-10-15 14:58:39,293 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:58:39,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1269, Unknown=0, NotChecked=0, Total=1482 [2024-10-15 14:58:39,294 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 87 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:39,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 441 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:58:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:58:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:58:39,296 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-10-15 14:58:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:58:39,296 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2024-10-15 14:58:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:39,296 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:58:39,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 22 states have internal predecessors, (61), 14 states have call successors, (41), 4 states have call predecessors, (41), 3 states have return successors, (41), 15 states have call predecessors, (41), 12 states have call successors, (41) [2024-10-15 14:58:39,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:58:39,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:58:39,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:58:39,317 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-15 14:58:39,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-15 14:58:39,507 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:39,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:58:41,314 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:58:41,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:58:41 BoogieIcfgContainer [2024-10-15 14:58:41,350 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:58:41,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:58:41,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:58:41,350 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:58:41,351 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:25" (3/4) ... [2024-10-15 14:58:41,353 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:58:41,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:58:41,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:58:41,413 INFO L158 Benchmark]: Toolchain (without parser) took 76790.19ms. Allocated memory was 174.1MB in the beginning and 400.6MB in the end (delta: 226.5MB). Free memory was 119.1MB in the beginning and 260.7MB in the end (delta: -141.7MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2024-10-15 14:58:41,414 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 174.1MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:58:41,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.71ms. Allocated memory is still 174.1MB. Free memory was 119.1MB in the beginning and 106.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 14:58:41,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.63ms. Allocated memory is still 174.1MB. Free memory was 106.5MB in the beginning and 105.6MB in the end (delta: 953.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:58:41,415 INFO L158 Benchmark]: Boogie Preprocessor took 49.90ms. Allocated memory is still 174.1MB. Free memory was 105.2MB in the beginning and 103.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:58:41,415 INFO L158 Benchmark]: RCFGBuilder took 359.75ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 89.7MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 14:58:41,416 INFO L158 Benchmark]: TraceAbstraction took 76027.33ms. Allocated memory was 174.1MB in the beginning and 400.6MB in the end (delta: 226.5MB). Free memory was 89.2MB in the beginning and 262.8MB in the end (delta: -173.6MB). Peak memory consumption was 189.7MB. Max. memory is 16.1GB. [2024-10-15 14:58:41,416 INFO L158 Benchmark]: Witness Printer took 62.67ms. Allocated memory is still 400.6MB. Free memory was 262.8MB in the beginning and 260.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:58:41,419 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.22ms. Allocated memory is still 174.1MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.71ms. Allocated memory is still 174.1MB. Free memory was 119.1MB in the beginning and 106.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.63ms. Allocated memory is still 174.1MB. Free memory was 106.5MB in the beginning and 105.6MB in the end (delta: 953.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.90ms. Allocated memory is still 174.1MB. Free memory was 105.2MB in the beginning and 103.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.75ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 89.7MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 76027.33ms. Allocated memory was 174.1MB in the beginning and 400.6MB in the end (delta: 226.5MB). Free memory was 89.2MB in the beginning and 262.8MB in the end (delta: -173.6MB). Peak memory consumption was 189.7MB. Max. memory is 16.1GB. * Witness Printer took 62.67ms. Allocated memory is still 400.6MB. Free memory was 262.8MB in the beginning and 260.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.1s, OverallIterations: 16, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 375 SdHoareTripleChecker+Valid, 12.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 3366 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2774 mSDsCounter, 545 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3009 IncrementalHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 545 mSolverCounterUnsat, 592 mSDtfsCounter, 3009 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2133 GetRequests, 1913 SyntacticMatches, 10 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 35.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=11, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 96 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 27.6s InterpolantComputationTime, 2106 NumberOfCodeBlocks, 2036 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2460 ConstructedInterpolants, 0 QuantifiedInterpolants, 21831 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2338 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 30 InterpolantComputations, 8 PerfectInterpolantSequences, 10345/10991 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: ((((((((((((A == r) && (p == 2)) && (d == 2)) && (q == 0)) && (B == 1)) || (((((((A == ((long long) q + r)) && (0 <= A)) && (r <= 1)) && (d == 4)) && (B == 1)) && (p == 4)) && (A <= 5))) || (((((((A == r) && (d == 4)) && (2 <= r)) && (q == 0)) && (B == 1)) && (r <= 3)) && (p == 4))) || (((((((A == ((long long) q + r)) && (0 <= A)) && (r <= 1)) && (p == 2)) && (d == 2)) && (B == 1)) && (A <= 5))) || (((((((A == r) && (p == 8)) && (q == 0)) && (B == 1)) && (d == 8)) && (4 <= r)) && (A <= 5))) || (((((A == ((long long) r + 1)) && (d == 1)) && (B == 1)) && (q == 1)) && (p == 1))) || (((((((A == ((long long) q + r)) && (0 <= A)) && (r <= 5)) && (d == 1)) && (B == 1)) && (A <= 5)) && (p == 1))) || (((((A == r) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((0 <= A) && (A == r)) && (r <= 5)) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1)) || (((((((A == r) && (p == 8)) && (q == 0)) && (B == 1)) && (d == 8)) && (4 <= r)) && (A <= 5))) || (((((((0 <= A) && (A == r)) && (p == 2)) && (d == 2)) && (q == 0)) && (B == 1)) && (A <= 5))) || (((((((A == r) && (d == 4)) && (r <= 5)) && (2 <= r)) && (q == 0)) && (B == 1)) && (p == 4))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:58:41,495 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