./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_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/hard-ll_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 a93c350e5795e32421c3bef9d7525c3fd53f570f971d574def19132b3d6f08b8 --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:52:55,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:52:55,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:52:55,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:52:55,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:52:55,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:52:55,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:52:55,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:52:55,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:52:55,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:52:55,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:52:55,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:52:55,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:52:55,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:52:55,272 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:52:55,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:52:55,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:52:55,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:52:55,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:52:55,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:52:55,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:52:55,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:52:55,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:52:55,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:52:55,275 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:52:55,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:52:55,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:52:55,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:52:55,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:52:55,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:52:55,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:52:55,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:52:55,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:52:55,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:52:55,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:52:55,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:52:55,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:52:55,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:52:55,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:52:55,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:52:55,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:52:55,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:52:55,282 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 -> a93c350e5795e32421c3bef9d7525c3fd53f570f971d574def19132b3d6f08b8 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:52:55,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:52:55,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:52:55,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:52:55,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:52:55,492 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:52:55,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c [2024-10-15 14:52:56,694 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:52:56,831 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:52:56,832 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c [2024-10-15 14:52:56,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b11716246/737a2fc8ae9c46d290c3b75cd5d1b9aa/FLAGd3e23cb0e [2024-10-15 14:52:57,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b11716246/737a2fc8ae9c46d290c3b75cd5d1b9aa [2024-10-15 14:52:57,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:52:57,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:52:57,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:52:57,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:52:57,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:52:57,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507d7dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57, skipping insertion in model container [2024-10-15 14:52:57,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:52:57,413 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/hard-ll_valuebound5.c[538,551] [2024-10-15 14:52:57,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:52:57,443 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:52:57,452 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/hard-ll_valuebound5.c[538,551] [2024-10-15 14:52:57,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:52:57,475 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:52:57,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57 WrapperNode [2024-10-15 14:52:57,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:52:57,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:52:57,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:52:57,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:52:57,482 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:52:57" (1/1) ... [2024-10-15 14:52:57,491 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:52:57" (1/1) ... [2024-10-15 14:52:57,498 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:52:57,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:52:57,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:52:57,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:52:57,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:52:57,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,520 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 14:52:57,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:52:57,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:52:57,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:52:57,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:52:57,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (1/1) ... [2024-10-15 14:52:57,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:52:57,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:57,562 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:52:57,564 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:52:57,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:52:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:52:57,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:52:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:52:57,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:52:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:52:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:52:57,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:52:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:52:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:52:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:52:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:52:57,646 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:52:57,648 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:52:57,778 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:52:57,778 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:52:57,799 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:52:57,801 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:52:57,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:52:57 BoogieIcfgContainer [2024-10-15 14:52:57,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:52:57,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:52:57,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:52:57,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:52:57,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:52:57" (1/3) ... [2024-10-15 14:52:57,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb1820d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:52:57, skipping insertion in model container [2024-10-15 14:52:57,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:57" (2/3) ... [2024-10-15 14:52:57,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb1820d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:52:57, skipping insertion in model container [2024-10-15 14:52:57,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:52:57" (3/3) ... [2024-10-15 14:52:57,810 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound5.c [2024-10-15 14:52:57,822 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:52:57,823 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:52:57,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:52:57,885 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;@47e62eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:52:57,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:52:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-15 14:52:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-15 14:52:57,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:57,896 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:52:57,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:57,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-10-15 14:52:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:57,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537701259] [2024-10-15 14:52:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:52:58,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:58,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537701259] [2024-10-15 14:52:58,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537701259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:58,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:58,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:52:58,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404371005] [2024-10-15 14:52:58,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:58,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:52:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:58,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:52:58,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:52:58,070 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:52:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:58,105 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-10-15 14:52:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:52:58,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-15 14:52:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:58,113 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:52:58,114 INFO L226 Difference]: Without dead ends: 32 [2024-10-15 14:52:58,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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:52:58,120 INFO L432 NwaCegarLoop]: 44 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, 44 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:52:58,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:52:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-15 14:52:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-15 14:52:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:52:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-10-15 14:52:58,153 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-10-15 14:52:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:58,153 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-15 14:52:58,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:52:58,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-10-15 14:52:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-15 14:52:58,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:58,157 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:52:58,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:52:58,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:58,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:58,159 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-10-15 14:52:58,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:58,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914774970] [2024-10-15 14:52:58,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:58,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:52:58,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:58,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914774970] [2024-10-15 14:52:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914774970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:58,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:58,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184648121] [2024-10-15 14:52:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:58,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:58,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:58,393 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-15 14:52:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:58,473 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-10-15 14:52:58,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:58,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-10-15 14:52:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:58,474 INFO L225 Difference]: With dead ends: 45 [2024-10-15 14:52:58,475 INFO L226 Difference]: Without dead ends: 43 [2024-10-15 14:52:58,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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:52:58,476 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 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:52:58,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:52:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-15 14:52:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-10-15 14:52:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:52:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-15 14:52:58,486 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-10-15 14:52:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:58,487 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-15 14:52:58,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-15 14:52:58,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-10-15 14:52:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-15 14:52:58,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:58,488 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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:52:58,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:52:58,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:58,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-10-15 14:52:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042526809] [2024-10-15 14:52:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:52:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:52:58,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042526809] [2024-10-15 14:52:58,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042526809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:58,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:58,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:58,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079704011] [2024-10-15 14:52:58,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:58,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:58,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:58,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:58,620 INFO L87 Difference]: Start difference. First operand 36 states and 45 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:52:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:58,683 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-10-15 14:52:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:58,684 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 32 [2024-10-15 14:52:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:58,686 INFO L225 Difference]: With dead ends: 49 [2024-10-15 14:52:58,687 INFO L226 Difference]: Without dead ends: 47 [2024-10-15 14:52:58,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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:52:58,688 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 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:52:58,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:52:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-15 14:52:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-10-15 14:52:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:52:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-15 14:52:58,701 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-10-15 14:52:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:58,702 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-15 14:52:58,702 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:52:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-10-15 14:52:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-15 14:52:58,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:58,704 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:52:58,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:52:58,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:58,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:58,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-10-15 14:52:58,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:58,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462846513] [2024-10-15 14:52:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:58,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:58,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795750636] [2024-10-15 14:52:58,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:58,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:58,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:58,733 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:52:58,735 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:52:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:52:58,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-15 14:52:58,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:52:58,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462846513] [2024-10-15 14:52:58,883 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:52:58,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795750636] [2024-10-15 14:52:58,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795750636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:58,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:58,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:58,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630870373] [2024-10-15 14:52:58,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:58,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:58,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:58,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:58,888 INFO L87 Difference]: Start difference. First operand 40 states and 48 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 14:52:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:58,957 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-10-15 14:52:58,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:58,957 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-10-15 14:52:58,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:58,958 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:52:58,958 INFO L226 Difference]: Without dead ends: 53 [2024-10-15 14:52:58,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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:52:58,959 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:58,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:52:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-15 14:52:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-15 14:52:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-15 14:52:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-10-15 14:52:58,970 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-10-15 14:52:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:58,970 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-10-15 14:52:58,971 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 14:52:58,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-10-15 14:52:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-15 14:52:58,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:58,972 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1] [2024-10-15 14:52:58,984 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:52:59,176 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:52:59,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:59,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-10-15 14:52:59,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:59,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609581980] [2024-10-15 14:52:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:59,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:59,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585731489] [2024-10-15 14:52:59,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:59,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:59,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:59,198 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:52:59,200 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:52:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:59,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-15 14:52:59,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-15 14:52:59,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:52:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-15 14:52:59,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:59,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609581980] [2024-10-15 14:52:59,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:52:59,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585731489] [2024-10-15 14:52:59,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585731489] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:52:59,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:52:59,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-15 14:52:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677977247] [2024-10-15 14:52:59,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:52:59,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:52:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:52:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:52:59,513 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-15 14:52:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:59,608 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-10-15 14:52:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:52:59,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-10-15 14:52:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:59,613 INFO L225 Difference]: With dead ends: 68 [2024-10-15 14:52:59,613 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 14:52:59,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:52:59,614 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:59,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:52:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 14:52:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-10-15 14:52:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-15 14:52:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-10-15 14:52:59,629 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 44 [2024-10-15 14:52:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:59,629 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-10-15 14:52:59,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-15 14:52:59,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-10-15 14:52:59,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-15 14:52:59,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:59,631 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:52:59,648 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:52:59,838 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:52:59,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:59,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-10-15 14:52:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:59,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467104204] [2024-10-15 14:52:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:59,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:59,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285728150] [2024-10-15 14:52:59,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:59,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:59,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:59,869 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:52:59,870 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:52:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:59,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 14:52:59,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-15 14:52:59,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-15 14:53:00,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:00,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467104204] [2024-10-15 14:53:00,075 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:00,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285728150] [2024-10-15 14:53:00,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285728150] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:00,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:53:00,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-15 14:53:00,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330147505] [2024-10-15 14:53:00,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:53:00,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:53:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:00,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:53:00,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:53:00,077 INFO L87 Difference]: Start difference. First operand 63 states and 80 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-15 14:53:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:00,136 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-10-15 14:53:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:53:00,137 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-10-15 14:53:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:00,138 INFO L225 Difference]: With dead ends: 73 [2024-10-15 14:53:00,138 INFO L226 Difference]: Without dead ends: 71 [2024-10-15 14:53:00,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 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:53:00,139 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:00,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:53:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-15 14:53:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-15 14:53:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-15 14:53:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-10-15 14:53:00,156 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2024-10-15 14:53:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:00,156 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-10-15 14:53:00,157 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-15 14:53:00,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-10-15 14:53:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-15 14:53:00,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:00,158 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:00,173 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:53:00,358 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:53:00,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:00,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:00,359 INFO L85 PathProgramCache]: Analyzing trace with hash 515743006, now seen corresponding path program 1 times [2024-10-15 14:53:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:00,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987178488] [2024-10-15 14:53:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:53:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-15 14:53:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:00,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987178488] [2024-10-15 14:53:00,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987178488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:53:00,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:53:00,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:53:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8823056] [2024-10-15 14:53:00,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:53:00,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:53:00,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:53:00,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:53:00,476 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-15 14:53:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:00,525 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-10-15 14:53:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:53:00,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2024-10-15 14:53:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:00,526 INFO L225 Difference]: With dead ends: 78 [2024-10-15 14:53:00,526 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 14:53:00,527 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:53:00,527 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:00,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:53:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 14:53:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-15 14:53:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 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:53:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-10-15 14:53:00,536 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2024-10-15 14:53:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:00,537 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-10-15 14:53:00,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-15 14:53:00,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-10-15 14:53:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-15 14:53:00,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:00,538 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 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, 1] [2024-10-15 14:53:00,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:53:00,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:00,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:00,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-10-15 14:53:00,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:00,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263988486] [2024-10-15 14:53:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:00,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:53:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730553449] [2024-10-15 14:53:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:00,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:00,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:00,558 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:53:00,559 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:53:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:00,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-15 14:53:00,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-15 14:53:01,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-15 14:53:02,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:02,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263988486] [2024-10-15 14:53:02,304 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:02,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730553449] [2024-10-15 14:53:02,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730553449] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:02,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:53:02,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-10-15 14:53:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870273355] [2024-10-15 14:53:02,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:02,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-15 14:53:02,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-15 14:53:02,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-10-15 14:53:02,306 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2024-10-15 14:53:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:03,217 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2024-10-15 14:53:03,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-15 14:53:03,218 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 74 [2024-10-15 14:53:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:03,220 INFO L225 Difference]: With dead ends: 153 [2024-10-15 14:53:03,221 INFO L226 Difference]: Without dead ends: 130 [2024-10-15 14:53:03,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:53:03,222 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 79 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:03,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 256 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:53:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-15 14:53:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2024-10-15 14:53:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-15 14:53:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2024-10-15 14:53:03,257 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 74 [2024-10-15 14:53:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:03,257 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2024-10-15 14:53:03,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2024-10-15 14:53:03,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2024-10-15 14:53:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-15 14:53:03,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:03,260 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 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:53:03,273 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-15 14:53:03,464 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:53:03,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:03,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-10-15 14:53:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413260680] [2024-10-15 14:53:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:53:03,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134074685] [2024-10-15 14:53:03,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:03,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:03,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:03,487 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:53:03,489 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:53:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:03,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-15 14:53:03,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-15 14:53:03,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-15 14:53:04,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413260680] [2024-10-15 14:53:04,391 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134074685] [2024-10-15 14:53:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134074685] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:04,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:53:04,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-10-15 14:53:04,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060104326] [2024-10-15 14:53:04,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:04,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 14:53:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:04,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 14:53:04,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-15 14:53:04,392 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-10-15 14:53:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:04,801 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2024-10-15 14:53:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 14:53:04,801 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) Word has length 85 [2024-10-15 14:53:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:04,802 INFO L225 Difference]: With dead ends: 145 [2024-10-15 14:53:04,802 INFO L226 Difference]: Without dead ends: 111 [2024-10-15 14:53:04,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:53:04,803 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 25 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:04,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 414 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:53:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-15 14:53:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-10-15 14:53:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 59 states have internal predecessors, (66), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-15 14:53:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-10-15 14:53:04,824 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 85 [2024-10-15 14:53:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:04,824 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-10-15 14:53:04,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-10-15 14:53:04,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:04,825 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-10-15 14:53:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-15 14:53:04,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:04,825 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 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] [2024-10-15 14:53:04,838 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-15 14:53:05,026 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:53:05,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:05,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1973508941, now seen corresponding path program 2 times [2024-10-15 14:53:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:05,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670213075] [2024-10-15 14:53:05,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:05,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:53:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-15 14:53:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-15 14:53:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:05,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670213075] [2024-10-15 14:53:05,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670213075] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030127613] [2024-10-15 14:53:05,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:53:05,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:05,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:05,213 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:53:05,214 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:53:05,259 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:53:05,259 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:05,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:53:05,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-15 14:53:05,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-15 14:53:05,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030127613] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:05,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:05,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-15 14:53:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161707608] [2024-10-15 14:53:05,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:05,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:53:05,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:05,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:53:05,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:53:05,352 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-15 14:53:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:05,413 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2024-10-15 14:53:05,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 14:53:05,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 87 [2024-10-15 14:53:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:05,415 INFO L225 Difference]: With dead ends: 124 [2024-10-15 14:53:05,415 INFO L226 Difference]: Without dead ends: 102 [2024-10-15 14:53:05,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:53:05,415 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:05,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:53:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-15 14:53:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-15 14:53:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-15 14:53:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-10-15 14:53:05,439 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 87 [2024-10-15 14:53:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:05,439 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-15 14:53:05,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-15 14:53:05,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:05,439 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-10-15 14:53:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-15 14:53:05,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:05,440 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 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, 1, 1] [2024-10-15 14:53:05,453 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-15 14:53:05,644 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:53:05,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:05,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:05,645 INFO L85 PathProgramCache]: Analyzing trace with hash -637517709, now seen corresponding path program 1 times [2024-10-15 14:53:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:05,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128051101] [2024-10-15 14:53:05,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:05,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:53:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-15 14:53:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-15 14:53:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-15 14:53:05,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:05,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128051101] [2024-10-15 14:53:05,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128051101] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:05,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303020146] [2024-10-15 14:53:05,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:05,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:05,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:05,868 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:53:05,870 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:53:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-15 14:53:05,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-10-15 14:53:06,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-15 14:53:06,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303020146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:06,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:06,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 18 [2024-10-15 14:53:06,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498949473] [2024-10-15 14:53:06,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:06,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-15 14:53:06,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:06,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 14:53:06,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-15 14:53:06,419 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-15 14:53:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:06,639 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2024-10-15 14:53:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 14:53:06,639 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) Word has length 90 [2024-10-15 14:53:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:06,640 INFO L225 Difference]: With dead ends: 117 [2024-10-15 14:53:06,640 INFO L226 Difference]: Without dead ends: 100 [2024-10-15 14:53:06,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-10-15 14:53:06,641 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:06,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 384 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:53:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-15 14:53:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-10-15 14:53:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-15 14:53:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-10-15 14:53:06,661 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 90 [2024-10-15 14:53:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:06,662 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-10-15 14:53:06,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-15 14:53:06,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-10-15 14:53:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-15 14:53:06,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:06,663 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:06,676 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:53:06,866 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:53:06,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:06,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:06,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1204328542, now seen corresponding path program 1 times [2024-10-15 14:53:06,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:06,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927630160] [2024-10-15 14:53:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:06,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:53:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-15 14:53:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-15 14:53:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-15 14:53:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-15 14:53:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:06,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927630160] [2024-10-15 14:53:06,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927630160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:06,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735425036] [2024-10-15 14:53:06,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:06,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:06,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:06,946 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:53:06,947 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:53:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:06,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 14:53:06,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-15 14:53:07,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:53:07,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735425036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:53:07,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:53:07,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-10-15 14:53:07,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451489525] [2024-10-15 14:53:07,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:53:07,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:53:07,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:07,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:53:07,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:53:07,013 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-15 14:53:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:07,063 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-10-15 14:53:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:53:07,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 94 [2024-10-15 14:53:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:07,064 INFO L225 Difference]: With dead ends: 100 [2024-10-15 14:53:07,064 INFO L226 Difference]: Without dead ends: 88 [2024-10-15 14:53:07,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:53:07,065 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:07,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:53:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-15 14:53:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-15 14:53:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-15 14:53:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2024-10-15 14:53:07,082 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 94 [2024-10-15 14:53:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:07,082 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2024-10-15 14:53:07,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-15 14:53:07,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2024-10-15 14:53:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-15 14:53:07,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:07,084 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 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, 1, 1] [2024-10-15 14:53:07,096 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:53:07,284 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:53:07,284 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:07,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:07,285 INFO L85 PathProgramCache]: Analyzing trace with hash -588826413, now seen corresponding path program 3 times [2024-10-15 14:53:07,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:07,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597430902] [2024-10-15 14:53:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:53:07,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104165129] [2024-10-15 14:53:07,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:53:07,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:07,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:07,322 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:53:07,323 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:53:07,409 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-15 14:53:07,409 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:07,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-15 14:53:07,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 37 proven. 49 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-15 14:53:07,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 37 proven. 49 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-15 14:53:19,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:19,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597430902] [2024-10-15 14:53:19,265 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:19,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104165129] [2024-10-15 14:53:19,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104165129] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:19,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:53:19,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-10-15 14:53:19,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393755525] [2024-10-15 14:53:19,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:19,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-15 14:53:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:19,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-15 14:53:19,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-15 14:53:19,267 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2024-10-15 14:53:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:25,110 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2024-10-15 14:53:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-15 14:53:25,111 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) Word has length 104 [2024-10-15 14:53:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:25,112 INFO L225 Difference]: With dead ends: 162 [2024-10-15 14:53:25,112 INFO L226 Difference]: Without dead ends: 140 [2024-10-15 14:53:25,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:53:25,113 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 52 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:25,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 433 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-15 14:53:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-15 14:53:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2024-10-15 14:53:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 38 states have call successors, (38), 15 states have call predecessors, (38), 14 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-15 14:53:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2024-10-15 14:53:25,145 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 104 [2024-10-15 14:53:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:25,145 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2024-10-15 14:53:25,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2024-10-15 14:53:25,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2024-10-15 14:53:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-15 14:53:25,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:25,146 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 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:53:25,152 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:53:25,347 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:53:25,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:25,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1973122394, now seen corresponding path program 2 times [2024-10-15 14:53:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:25,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306908575] [2024-10-15 14:53:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:53:25,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708213889] [2024-10-15 14:53:25,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:53:25,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:25,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:25,388 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:53:25,388 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:53:25,438 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:53:25,438 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:25,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-15 14:53:25,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 124 proven. 22 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-10-15 14:53:25,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-15 14:53:25,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306908575] [2024-10-15 14:53:25,680 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708213889] [2024-10-15 14:53:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708213889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:25,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:53:25,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2024-10-15 14:53:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93618417] [2024-10-15 14:53:25,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:25,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-15 14:53:25,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:25,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-15 14:53:25,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-15 14:53:25,682 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-15 14:53:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:26,106 INFO L93 Difference]: Finished difference Result 142 states and 169 transitions. [2024-10-15 14:53:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 14:53:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 115 [2024-10-15 14:53:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:26,108 INFO L225 Difference]: With dead ends: 142 [2024-10-15 14:53:26,108 INFO L226 Difference]: Without dead ends: 140 [2024-10-15 14:53:26,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-10-15 14:53:26,109 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:26,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 216 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:53:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-15 14:53:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-15 14:53:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 84 states have (on average 1.1071428571428572) internal successors, (93), 88 states have internal predecessors, (93), 38 states have call successors, (38), 18 states have call predecessors, (38), 17 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-15 14:53:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2024-10-15 14:53:26,145 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 115 [2024-10-15 14:53:26,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:26,149 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2024-10-15 14:53:26,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-15 14:53:26,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2024-10-15 14:53:26,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-15 14:53:26,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:26,150 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:26,163 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-15 14:53:26,351 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:53:26,351 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:26,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1536141598, now seen corresponding path program 4 times [2024-10-15 14:53:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:26,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926485665] [2024-10-15 14:53:26,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:53:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-15 14:53:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-15 14:53:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-15 14:53:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-15 14:53:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-15 14:53:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-15 14:53:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-10-15 14:53:26,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926485665] [2024-10-15 14:53:26,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926485665] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106028863] [2024-10-15 14:53:26,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 14:53:26,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:26,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:26,548 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:53:26,549 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:53:26,597 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 14:53:26,598 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:26,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 14:53:26,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-10-15 14:53:26,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-10-15 14:53:26,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106028863] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:26,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-15 14:53:26,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414158117] [2024-10-15 14:53:26,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:26,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:53:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:26,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:53:26,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:53:26,746 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-10-15 14:53:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:26,849 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2024-10-15 14:53:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:53:26,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) Word has length 117 [2024-10-15 14:53:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:26,852 INFO L225 Difference]: With dead ends: 167 [2024-10-15 14:53:26,852 INFO L226 Difference]: Without dead ends: 144 [2024-10-15 14:53:26,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:53:26,854 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:26,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 273 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:53:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-15 14:53:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-10-15 14:53:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 90 states have internal predecessors, (94), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-15 14:53:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2024-10-15 14:53:26,902 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 117 [2024-10-15 14:53:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:26,903 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2024-10-15 14:53:26,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-10-15 14:53:26,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2024-10-15 14:53:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-15 14:53:26,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:26,904 INFO L215 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 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, 1, 1] [2024-10-15 14:53:26,916 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:53:27,104 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:53:27,105 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:27,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:27,105 INFO L85 PathProgramCache]: Analyzing trace with hash 47128766, now seen corresponding path program 2 times [2024-10-15 14:53:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:27,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076356529] [2024-10-15 14:53:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:53:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-15 14:53:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-15 14:53:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-15 14:53:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-15 14:53:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-15 14:53:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-15 14:53:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-15 14:53:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-10-15 14:53:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076356529] [2024-10-15 14:53:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076356529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717579547] [2024-10-15 14:53:27,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:53:27,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:27,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:27,459 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:53:27,460 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:53:27,505 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:53:27,505 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:27,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-15 14:53:27,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-10-15 14:53:27,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-10-15 14:53:28,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717579547] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:28,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:28,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 14] total 30 [2024-10-15 14:53:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361808857] [2024-10-15 14:53:28,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:28,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-15 14:53:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-15 14:53:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2024-10-15 14:53:28,710 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) [2024-10-15 14:53:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:29,228 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2024-10-15 14:53:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:53:29,229 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) Word has length 120 [2024-10-15 14:53:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:29,229 INFO L225 Difference]: With dead ends: 158 [2024-10-15 14:53:29,230 INFO L226 Difference]: Without dead ends: 130 [2024-10-15 14:53:29,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2024-10-15 14:53:29,230 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:29,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 530 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:53:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-15 14:53:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2024-10-15 14:53:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 80 states have internal predecessors, (83), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-15 14:53:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2024-10-15 14:53:29,260 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 120 [2024-10-15 14:53:29,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:29,260 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2024-10-15 14:53:29,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) [2024-10-15 14:53:29,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2024-10-15 14:53:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-15 14:53:29,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:29,262 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:29,275 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:53:29,465 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:53:29,465 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:29,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1414642200, now seen corresponding path program 5 times [2024-10-15 14:53:29,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:29,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219700136] [2024-10-15 14:53:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:29,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:29,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:29,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:29,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:53:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-15 14:53:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-15 14:53:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-15 14:53:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-15 14:53:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-15 14:53:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-15 14:53:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-15 14:53:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-15 14:53:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-15 14:53:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-15 14:53:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219700136] [2024-10-15 14:53:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219700136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741563104] [2024-10-15 14:53:30,090 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 14:53:30,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:30,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:30,092 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:53:30,093 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-15 14:53:30,169 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-15 14:53:30,169 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:30,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-15 14:53:30,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 189 proven. 26 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-15 14:53:30,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 47 proven. 46 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-15 14:53:31,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741563104] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:31,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:31,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 15] total 35 [2024-10-15 14:53:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862090194] [2024-10-15 14:53:31,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:31,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-15 14:53:31,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:31,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-15 14:53:31,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2024-10-15 14:53:31,508 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 35 states have internal predecessors, (74), 24 states have call successors, (61), 2 states have call predecessors, (61), 3 states have return successors, (61), 24 states have call predecessors, (61), 24 states have call successors, (61) [2024-10-15 14:53:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:32,509 INFO L93 Difference]: Finished difference Result 174 states and 210 transitions. [2024-10-15 14:53:32,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-15 14:53:32,510 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 35 states have internal predecessors, (74), 24 states have call successors, (61), 2 states have call predecessors, (61), 3 states have return successors, (61), 24 states have call predecessors, (61), 24 states have call successors, (61) Word has length 134 [2024-10-15 14:53:32,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:32,511 INFO L225 Difference]: With dead ends: 174 [2024-10-15 14:53:32,511 INFO L226 Difference]: Without dead ends: 144 [2024-10-15 14:53:32,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2024-10-15 14:53:32,512 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 88 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:32,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 480 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:53:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-15 14:53:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2024-10-15 14:53:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.08) internal successors, (81), 78 states have internal predecessors, (81), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-15 14:53:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2024-10-15 14:53:32,548 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 134 [2024-10-15 14:53:32,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:32,549 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2024-10-15 14:53:32,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 35 states have internal predecessors, (74), 24 states have call successors, (61), 2 states have call predecessors, (61), 3 states have return successors, (61), 24 states have call predecessors, (61), 24 states have call successors, (61) [2024-10-15 14:53:32,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2024-10-15 14:53:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-15 14:53:32,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:32,550 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:32,563 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-15 14:53:32,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-15 14:53:32,750 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:32,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1191381354, now seen corresponding path program 1 times [2024-10-15 14:53:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:32,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351860207] [2024-10-15 14:53:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:53:32,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190756640] [2024-10-15 14:53:32,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:32,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:32,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:32,779 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:53:32,780 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-15 14:53:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:32,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-15 14:53:32,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 35 proven. 109 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2024-10-15 14:53:33,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:54:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-10-15 14:54:05,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:54:05,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351860207] [2024-10-15 14:54:05,338 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:54:05,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190756640] [2024-10-15 14:54:05,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190756640] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:54:05,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:54:05,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2024-10-15 14:54:05,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798410260] [2024-10-15 14:54:05,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:54:05,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-15 14:54:05,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:54:05,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-15 14:54:05,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2024-10-15 14:54:05,339 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 29 states have internal predecessors, (61), 18 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (43), 15 states have call predecessors, (43), 16 states have call successors, (43) [2024-10-15 14:54:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:54:23,640 INFO L93 Difference]: Finished difference Result 239 states and 298 transitions. [2024-10-15 14:54:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-15 14:54:23,641 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 29 states have internal predecessors, (61), 18 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (43), 15 states have call predecessors, (43), 16 states have call successors, (43) Word has length 134 [2024-10-15 14:54:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:54:23,642 INFO L225 Difference]: With dead ends: 239 [2024-10-15 14:54:23,642 INFO L226 Difference]: Without dead ends: 207 [2024-10-15 14:54:23,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=512, Invalid=1840, Unknown=0, NotChecked=0, Total=2352 [2024-10-15 14:54:23,643 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 101 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:54:23,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 680 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-15 14:54:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-15 14:54:23,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 197. [2024-10-15 14:54:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 122 states have (on average 1.1475409836065573) internal successors, (140), 126 states have internal predecessors, (140), 51 states have call successors, (51), 24 states have call predecessors, (51), 23 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-15 14:54:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 240 transitions. [2024-10-15 14:54:23,745 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 240 transitions. Word has length 134 [2024-10-15 14:54:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:54:23,745 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 240 transitions. [2024-10-15 14:54:23,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 29 states have internal predecessors, (61), 18 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (43), 15 states have call predecessors, (43), 16 states have call successors, (43) [2024-10-15 14:54:23,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 240 transitions. [2024-10-15 14:54:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-15 14:54:23,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:54:23,746 INFO L215 NwaCegarLoop]: trace histogram [20, 19, 19, 4, 4, 4, 4, 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] [2024-10-15 14:54:23,758 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-15 14:54:23,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-15 14:54:23,950 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:54:23,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash -909439750, now seen corresponding path program 2 times [2024-10-15 14:54:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:54:23,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281618106] [2024-10-15 14:54:23,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:54:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:54:23,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847453331] [2024-10-15 14:54:23,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:54:23,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:54:23,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:54:23,981 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:54:23,983 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-15 14:54:24,056 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:54:24,056 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:54:24,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-15 14:54:24,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:54:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 67 proven. 85 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2024-10-15 14:54:24,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:54:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 98 proven. 117 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-10-15 14:54:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:54:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281618106] [2024-10-15 14:54:40,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:54:40,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847453331] [2024-10-15 14:54:40,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847453331] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:54:40,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:54:40,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2024-10-15 14:54:40,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599394898] [2024-10-15 14:54:40,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:54:40,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-15 14:54:40,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:54:40,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-15 14:54:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=908, Unknown=1, NotChecked=0, Total=1122 [2024-10-15 14:54:40,422 INFO L87 Difference]: Start difference. First operand 197 states and 240 transitions. Second operand has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 31 states have internal predecessors, (64), 20 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (45), 19 states have call predecessors, (45), 20 states have call successors, (45) [2024-10-15 14:54:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:54:40,517 INFO L93 Difference]: Finished difference Result 197 states and 240 transitions. [2024-10-15 14:54:40,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:54:40,520 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 31 states have internal predecessors, (64), 20 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (45), 19 states have call predecessors, (45), 20 states have call successors, (45) Word has length 139 [2024-10-15 14:54:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:54:40,521 INFO L225 Difference]: With dead ends: 197 [2024-10-15 14:54:40,521 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:54:40,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=213, Invalid=908, Unknown=1, NotChecked=0, Total=1122 [2024-10-15 14:54:40,522 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:54:40,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:54:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:54:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:54:40,522 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:54:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:54:40,523 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2024-10-15 14:54:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:54:40,523 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:54:40,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 31 states have internal predecessors, (64), 20 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (45), 19 states have call predecessors, (45), 20 states have call successors, (45) [2024-10-15 14:54:40,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:54:40,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:54:40,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:54:40,538 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-15 14:54:40,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:54:40,732 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:54:40,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:54:42,323 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:54:42,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:54:42 BoogieIcfgContainer [2024-10-15 14:54:42,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:54:42,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:54:42,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:54:42,346 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:54:42,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:52:57" (3/4) ... [2024-10-15 14:54:42,348 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:54:42,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:54:42,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:54:42,393 INFO L158 Benchmark]: Toolchain (without parser) took 105133.16ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 92.1MB in the beginning and 131.3MB in the end (delta: -39.2MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2024-10-15 14:54:42,393 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:54:42,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.78ms. Allocated memory is still 165.7MB. Free memory was 91.9MB in the beginning and 78.7MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-15 14:54:42,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.80ms. Allocated memory is still 165.7MB. Free memory was 78.7MB in the beginning and 77.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:54:42,394 INFO L158 Benchmark]: Boogie Preprocessor took 32.96ms. Allocated memory is still 165.7MB. Free memory was 77.7MB in the beginning and 75.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:54:42,394 INFO L158 Benchmark]: RCFGBuilder took 269.77ms. Allocated memory is still 165.7MB. Free memory was 75.9MB in the beginning and 61.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-15 14:54:42,395 INFO L158 Benchmark]: TraceAbstraction took 104542.04ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 60.7MB in the beginning and 133.4MB in the end (delta: -72.7MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2024-10-15 14:54:42,395 INFO L158 Benchmark]: Witness Printer took 46.14ms. Allocated memory is still 257.9MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:54:42,397 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.11ms. Allocated memory is still 165.7MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.78ms. Allocated memory is still 165.7MB. Free memory was 91.9MB in the beginning and 78.7MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.80ms. Allocated memory is still 165.7MB. Free memory was 78.7MB in the beginning and 77.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.96ms. Allocated memory is still 165.7MB. Free memory was 77.7MB in the beginning and 75.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 269.77ms. Allocated memory is still 165.7MB. Free memory was 75.9MB in the beginning and 61.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 104542.04ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 60.7MB in the beginning and 133.4MB in the end (delta: -72.7MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. * Witness Printer took 46.14ms. Allocated memory is still 257.9MB. Free memory was 133.4MB in the beginning and 131.3MB 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, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 102.9s, OverallIterations: 19, TraceHistogramMax: 20, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 525 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 474 mSDsluCounter, 4867 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4101 mSDsCounter, 691 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3762 IncrementalHoareTripleChecker+Invalid, 4453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 691 mSolverCounterUnsat, 766 mSDtfsCounter, 3762 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3119 GetRequests, 2792 SyntacticMatches, 6 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1927 ImplicationChecksByTransitivity, 33.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=18, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 113 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 69.3s InterpolantComputationTime, 3002 NumberOfCodeBlocks, 2975 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3475 ConstructedInterpolants, 1 QuantifiedInterpolants, 43974 SizeOfPredicates, 33 NumberOfNonLiveVariables, 3078 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 38 InterpolantComputations, 7 PerfectInterpolantSequences, 12185/13176 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: 46]: Loop Invariant Derived loop invariant: ((((((((((((0 <= r) && (((__int128) r + 1) <= d)) && (((__int128) d + r) == A)) && (((__int128) r + ((long long) 2 * B)) == ((__int128) A + d))) && (q == 1)) && (p == 1)) || (((((((0 <= (r + ((((__int128) -1 * d) >= 0) ? (((__int128) -1 * d) / 2) : ((((__int128) -1 * d) / 2) - 1)))) && (((__int128) r + 1) <= d)) && (((__int128) A + d) == ((__int128) ((long long) B * 4) + r))) && (((d >= 0) ? (d % 2) : ((d % 2) + 2)) == 0)) && (q == 0)) && (p == 4)) && ((A + ((d >= 0) ? (d / 2) : ((d / 2) - 1))) == ((__int128) r + ((long long) 2 * B))))) || ((((((q == 2) && (0 <= r)) && (p == 2)) && (((__int128) A + d) == ((__int128) ((long long) B * 4) + r))) && (A == ((__int128) r + ((long long) 2 * B)))) && ((((__int128) d + r) + 1) <= ((long long) B * 4)))) || ((((((A == r) && (d == ((long long) 2 * B))) && (((__int128) r + 1) <= d)) && (p == 2)) && (q == 0)) && (B <= r))) || ((((((q == 2) && (B <= 2147483647)) && (((__int128) r + 1) <= ((__int128) d + ((d >= 0) ? (d / 2) : ((d / 2) - 1))))) && (d == (((A + ((__int128) -1 * r)) >= 0) ? ((A + ((__int128) -1 * r)) / 2) : (((A + ((__int128) -1 * r)) / 2) - 1)))) && (A == ((__int128) r + ((long long) 2 * B)))) && (p == 1))) || (((((((((__int128) r + B) + ((__int128) q * B)) == ((__int128) A + d)) && (((__int128) r + 1) <= ((__int128) d + ((d >= 0) ? (d / 2) : ((d / 2) - 1))))) && (((__int128) r + ((long long) 2 * B)) <= 4294967295)) && ((r + ((__int128) q * B)) == A)) && (((__int128) d + ((long long) 2 * B)) <= 4294967295)) && (p == 1))) || ((((d == B) && (A == r)) && (q == 0)) && (p == 1))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((d == B) && (A == r)) && (A <= 5)) && (q == 0)) && (1 <= d)) && (p == 1)) - 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:54:42,552 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE