./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 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/cohendiv-ll_unwindbound10.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 a340dc1e9a375ad2082e9c8cecf3a1a681edcfe0f7220085504fa1991ced3d70 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:43:51,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:43:51,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:43:51,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:43:51,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:43:51,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:43:51,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:43:51,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:43:51,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:43:51,914 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:43:51,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:43:51,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:43:51,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:43:51,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:43:51,916 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:43:51,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:43:51,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:43:51,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:43:51,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:43:51,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:43:51,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:43:51,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:43:51,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:43:51,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:43:51,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:43:51,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:43:51,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:43:51,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:43:51,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:43:51,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:43:51,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:43:51,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:43:51,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:43:51,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:43:51,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:43:51,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:43:51,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:43:51,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:43:51,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:43:51,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:43:51,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:43:51,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:43:51,925 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 -> a340dc1e9a375ad2082e9c8cecf3a1a681edcfe0f7220085504fa1991ced3d70 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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-09-25 10:43:52,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:43:52,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:43:52,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:43:52,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:43:52,210 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:43:52,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2024-09-25 10:43:53,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:43:53,782 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:43:53,782 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2024-09-25 10:43:53,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ba5069ea5/938c07f38c6349a8a035a95656377440/FLAG159137b25 [2024-09-25 10:43:54,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ba5069ea5/938c07f38c6349a8a035a95656377440 [2024-09-25 10:43:54,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:43:54,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:43:54,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:43:54,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:43:54,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:43:54,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230406d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54, skipping insertion in model container [2024-09-25 10:43:54,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:43:54,316 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/cohendiv-ll_unwindbound10.c[576,589] [2024-09-25 10:43:54,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:43:54,341 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:43:54,350 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/cohendiv-ll_unwindbound10.c[576,589] [2024-09-25 10:43:54,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:43:54,371 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:43:54,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54 WrapperNode [2024-09-25 10:43:54,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:43:54,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:43:54,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:43:54,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:43:54,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,387 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:43:54,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:43:54,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:43:54,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:43:54,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:43:54,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,413 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-09-25 10:43:54,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:43:54,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:43:54,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:43:54,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:43:54,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:43:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:54,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:43:54,456 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:43:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:43:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:43:54,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:43:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:43:54,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:43:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:43:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:43:54,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:43:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:43:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:43:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:43:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:43:54,551 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:43:54,553 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:43:54,696 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:43:54,696 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:43:54,710 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:43:54,710 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:43:54,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:43:54 BoogieIcfgContainer [2024-09-25 10:43:54,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:43:54,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:43:54,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:43:54,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:43:54,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:43:54" (1/3) ... [2024-09-25 10:43:54,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a21bb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:43:54, skipping insertion in model container [2024-09-25 10:43:54,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (2/3) ... [2024-09-25 10:43:54,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a21bb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:43:54, skipping insertion in model container [2024-09-25 10:43:54,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:43:54" (3/3) ... [2024-09-25 10:43:54,717 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound10.c [2024-09-25 10:43:54,729 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:43:54,729 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:43:54,767 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:43:54,772 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e753a38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:43:54,773 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:43:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 10:43:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:43:54,781 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:54,781 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:54,782 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:54,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash -166019731, now seen corresponding path program 1 times [2024-09-25 10:43:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:54,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673635441] [2024-09-25 10:43:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:54,890 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:54,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:43:54,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:54,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673635441] [2024-09-25 10:43:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673635441] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:54,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:54,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:43:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147673651] [2024-09-25 10:43:54,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:54,908 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:43:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:54,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:43:54,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:43:54,926 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:54,989 INFO L93 Difference]: Finished difference Result 65 states and 98 transitions. [2024-09-25 10:43:54,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:43:54,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 10:43:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:54,996 INFO L225 Difference]: With dead ends: 65 [2024-09-25 10:43:54,996 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 10:43:54,998 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:43:55,001 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:55,001 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 10:43:55,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-09-25 10:43:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:43:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-25 10:43:55,039 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 16 [2024-09-25 10:43:55,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:55,039 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-25 10:43:55,039 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:55,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-25 10:43:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:43:55,041 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:55,041 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:55,041 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:43:55,041 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:55,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1899526296, now seen corresponding path program 1 times [2024-09-25 10:43:55,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:55,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82310047] [2024-09-25 10:43:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:55,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:43:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:55,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82310047] [2024-09-25 10:43:55,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82310047] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:55,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:55,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:55,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198337330] [2024-09-25 10:43:55,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:55,198 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:55,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:55,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:55,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:55,199 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:43:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:55,289 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-09-25 10:43:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:43:55,290 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-09-25 10:43:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:55,291 INFO L225 Difference]: With dead ends: 41 [2024-09-25 10:43:55,291 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 10:43:55,291 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:55,292 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:55,292 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 10:43:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-25 10:43:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:43:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-25 10:43:55,300 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 17 [2024-09-25 10:43:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:55,300 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-25 10:43:55,301 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:43:55,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-25 10:43:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:43:55,302 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:55,302 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:55,302 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:43:55,302 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:55,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1901015846, now seen corresponding path program 1 times [2024-09-25 10:43:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:55,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568744172] [2024-09-25 10:43:55,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:55,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921134242] [2024-09-25 10:43:55,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:55,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:55,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:55,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:55,325 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:43:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:43:55,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:43:55,431 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:55,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:55,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568744172] [2024-09-25 10:43:55,435 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921134242] [2024-09-25 10:43:55,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921134242] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:55,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:55,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:55,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063100344] [2024-09-25 10:43:55,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:55,436 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:55,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:55,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:55,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:55,437 INFO L87 Difference]: Start difference. First operand 34 states and 43 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:55,500 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-25 10:43:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:55,500 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-25 10:43:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:55,505 INFO L225 Difference]: With dead ends: 44 [2024-09-25 10:43:55,505 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 10:43:55,505 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:55,506 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:55,506 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 10:43:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-09-25 10:43:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 10:43:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-09-25 10:43:55,524 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 17 [2024-09-25 10:43:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:55,525 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-09-25 10:43:55,525 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:55,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-09-25 10:43:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:43:55,526 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:55,526 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:55,539 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 10:43:55,726 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:55,727 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:55,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1706287866, now seen corresponding path program 1 times [2024-09-25 10:43:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:55,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048395209] [2024-09-25 10:43:55,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [947512725] [2024-09-25 10:43:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:55,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:55,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:55,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:55,754 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:43:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:43:55,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:43:55,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:55,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:55,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048395209] [2024-09-25 10:43:55,876 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:55,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947512725] [2024-09-25 10:43:55,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947512725] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:55,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:55,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104436573] [2024-09-25 10:43:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:55,877 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:55,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:55,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:55,878 INFO L87 Difference]: Start difference. First operand 39 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:43:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:55,926 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-09-25 10:43:55,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:55,927 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-25 10:43:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:55,928 INFO L225 Difference]: With dead ends: 57 [2024-09-25 10:43:55,928 INFO L226 Difference]: Without dead ends: 54 [2024-09-25 10:43:55,928 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:55,929 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:55,929 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-25 10:43:55,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-09-25 10:43:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-25 10:43:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-09-25 10:43:55,937 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 22 [2024-09-25 10:43:55,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:55,937 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-09-25 10:43:55,938 INFO L475 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:43:55,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-09-25 10:43:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 10:43:55,939 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:55,939 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:55,951 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:43:56,143 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:56,144 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:56,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1856957465, now seen corresponding path program 1 times [2024-09-25 10:43:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:56,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118444731] [2024-09-25 10:43:56,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:56,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:56,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865581045] [2024-09-25 10:43:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:56,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:56,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:56,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:56,202 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:43:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:43:56,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:43:56,263 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:56,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:56,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118444731] [2024-09-25 10:43:56,263 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:56,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865581045] [2024-09-25 10:43:56,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865581045] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:56,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:56,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016320915] [2024-09-25 10:43:56,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:56,264 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:56,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:56,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:56,265 INFO L87 Difference]: Start difference. First operand 53 states and 68 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, (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-09-25 10:43:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:56,322 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2024-09-25 10:43:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:56,323 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, (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 30 [2024-09-25 10:43:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:56,326 INFO L225 Difference]: With dead ends: 82 [2024-09-25 10:43:56,327 INFO L226 Difference]: Without dead ends: 80 [2024-09-25 10:43:56,327 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:56,327 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:56,329 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 141 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-25 10:43:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2024-09-25 10:43:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:43:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2024-09-25 10:43:56,349 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 30 [2024-09-25 10:43:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:56,352 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2024-09-25 10:43:56,352 INFO L475 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, (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-09-25 10:43:56,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2024-09-25 10:43:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-25 10:43:56,353 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:56,353 INFO L216 NwaCegarLoop]: trace histogram [3, 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, 1] [2024-09-25 10:43:56,366 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 10:43:56,553 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:56,554 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:56,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:56,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1900127414, now seen corresponding path program 1 times [2024-09-25 10:43:56,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:56,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668262558] [2024-09-25 10:43:56,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:56,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:43:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:43:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:43:56,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:56,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668262558] [2024-09-25 10:43:56,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668262558] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:56,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:56,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:43:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299837949] [2024-09-25 10:43:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:56,691 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:43:56,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:43:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:43:56,692 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 10:43:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:56,778 INFO L93 Difference]: Finished difference Result 112 states and 152 transitions. [2024-09-25 10:43:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:43:56,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2024-09-25 10:43:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:56,782 INFO L225 Difference]: With dead ends: 112 [2024-09-25 10:43:56,782 INFO L226 Difference]: Without dead ends: 77 [2024-09-25 10:43:56,783 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:43:56,783 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:56,783 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-25 10:43:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-09-25 10:43:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 48 states have internal predecessors, (57), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:43:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2024-09-25 10:43:56,803 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 33 [2024-09-25 10:43:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:56,804 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2024-09-25 10:43:56,804 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 10:43:56,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2024-09-25 10:43:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 10:43:56,805 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:56,805 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 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-09-25 10:43:56,805 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:43:56,805 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:56,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:56,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2073680743, now seen corresponding path program 1 times [2024-09-25 10:43:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:56,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845764144] [2024-09-25 10:43:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:43:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:43:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:43:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,010 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:43:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:43:57,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:57,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845764144] [2024-09-25 10:43:57,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845764144] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:57,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:57,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-25 10:43:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677766161] [2024-09-25 10:43:57,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:57,017 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:43:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:43:57,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:43:57,018 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 10:43:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:57,172 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2024-09-25 10:43:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:43:57,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-09-25 10:43:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:57,173 INFO L225 Difference]: With dead ends: 83 [2024-09-25 10:43:57,173 INFO L226 Difference]: Without dead ends: 81 [2024-09-25 10:43:57,174 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:43:57,174 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:57,174 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 121 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-25 10:43:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-09-25 10:43:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:43:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-09-25 10:43:57,191 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 40 [2024-09-25 10:43:57,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:57,191 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-09-25 10:43:57,191 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 10:43:57,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-09-25 10:43:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 10:43:57,192 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:57,192 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 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-09-25 10:43:57,192 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 10:43:57,192 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:57,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash -930915559, now seen corresponding path program 1 times [2024-09-25 10:43:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851790271] [2024-09-25 10:43:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:43:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:43:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:43:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:43:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:43:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 10:43:57,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:57,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851790271] [2024-09-25 10:43:57,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851790271] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:43:57,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068655894] [2024-09-25 10:43:57,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:57,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:57,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:57,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:57,344 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:43:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:43:57,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:43:57,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:57,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068655894] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:57,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:43:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-09-25 10:43:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758600275] [2024-09-25 10:43:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:57,453 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:43:57,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:57,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:43:57,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:43:57,454 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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-09-25 10:43:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:57,521 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2024-09-25 10:43:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:43:57,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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 46 [2024-09-25 10:43:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:57,522 INFO L225 Difference]: With dead ends: 94 [2024-09-25 10:43:57,523 INFO L226 Difference]: Without dead ends: 92 [2024-09-25 10:43:57,523 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:43:57,523 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:57,523 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 185 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-25 10:43:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-09-25 10:43:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 56 states have internal predecessors, (63), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-25 10:43:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2024-09-25 10:43:57,535 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 46 [2024-09-25 10:43:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:57,536 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2024-09-25 10:43:57,536 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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-09-25 10:43:57,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2024-09-25 10:43:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 10:43:57,537 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:57,537 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:57,551 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:43:57,737 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:57,738 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:57,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash -872582608, now seen corresponding path program 1 times [2024-09-25 10:43:57,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:57,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289576449] [2024-09-25 10:43:57,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:57,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:43:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:43:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:43:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:43:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:43:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:43:57,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:57,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289576449] [2024-09-25 10:43:57,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289576449] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:43:57,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589369191] [2024-09-25 10:43:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:57,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:57,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:57,865 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:43:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:43:57,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 10:43:57,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:43:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589369191] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:58,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:43:58,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2024-09-25 10:43:58,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119328075] [2024-09-25 10:43:58,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:58,049 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:43:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:58,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:43:58,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:43:58,049 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 9 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2024-09-25 10:43:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:58,293 INFO L93 Difference]: Finished difference Result 254 states and 311 transitions. [2024-09-25 10:43:58,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 10:43:58,293 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 9 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 49 [2024-09-25 10:43:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:58,295 INFO L225 Difference]: With dead ends: 254 [2024-09-25 10:43:58,295 INFO L226 Difference]: Without dead ends: 247 [2024-09-25 10:43:58,295 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:43:58,296 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 109 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:58,296 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 148 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:43:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-09-25 10:43:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2024-09-25 10:43:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 155 states have internal predecessors, (175), 58 states have call successors, (58), 27 states have call predecessors, (58), 26 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-25 10:43:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2024-09-25 10:43:58,334 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 49 [2024-09-25 10:43:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:58,335 INFO L474 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2024-09-25 10:43:58,335 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 9 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2024-09-25 10:43:58,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2024-09-25 10:43:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 10:43:58,336 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:58,336 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1] [2024-09-25 10:43:58,348 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:43:58,539 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:58,539 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:58,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash 260253794, now seen corresponding path program 1 times [2024-09-25 10:43:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:58,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907777958] [2024-09-25 10:43:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:58,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:58,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609433762] [2024-09-25 10:43:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:58,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:58,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:58,551 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:58,554 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:43:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:58,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-25 10:43:58,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:43:58,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:43:58,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:58,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907777958] [2024-09-25 10:43:58,997 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:58,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609433762] [2024-09-25 10:43:58,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609433762] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 10:43:58,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:43:58,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-09-25 10:43:58,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355543828] [2024-09-25 10:43:58,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:58,997 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:43:58,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:58,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:43:58,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:43:58,998 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 10:43:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:59,110 INFO L93 Difference]: Finished difference Result 249 states and 303 transitions. [2024-09-25 10:43:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:59,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2024-09-25 10:43:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:59,112 INFO L225 Difference]: With dead ends: 249 [2024-09-25 10:43:59,112 INFO L226 Difference]: Without dead ends: 243 [2024-09-25 10:43:59,113 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:43:59,113 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:59,114 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 113 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-09-25 10:43:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 178. [2024-09-25 10:43:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 114 states have (on average 1.131578947368421) internal successors, (129), 119 states have internal predecessors, (129), 39 states have call successors, (39), 25 states have call predecessors, (39), 24 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-09-25 10:43:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2024-09-25 10:43:59,171 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 54 [2024-09-25 10:43:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:59,172 INFO L474 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2024-09-25 10:43:59,172 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 10:43:59,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2024-09-25 10:43:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-25 10:43:59,173 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:59,173 INFO L216 NwaCegarLoop]: trace histogram [10, 9, 9, 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] [2024-09-25 10:43:59,189 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:43:59,377 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 10:43:59,377 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:59,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:59,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1070557628, now seen corresponding path program 1 times [2024-09-25 10:43:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:59,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899829314] [2024-09-25 10:43:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:43:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:43:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:43:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:43:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:43:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 10:43:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:43:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-25 10:43:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-25 10:43:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-09-25 10:43:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899829314] [2024-09-25 10:43:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899829314] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:43:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399676110] [2024-09-25 10:43:59,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:59,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:59,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:59,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:43:59,487 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:43:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:43:59,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-09-25 10:43:59,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-09-25 10:43:59,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399676110] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:59,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:43:59,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-09-25 10:43:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102223334] [2024-09-25 10:43:59,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:59,646 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:43:59,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:59,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:43:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:43:59,647 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-25 10:43:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:59,800 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2024-09-25 10:43:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:43:59,801 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 70 [2024-09-25 10:43:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:59,801 INFO L225 Difference]: With dead ends: 190 [2024-09-25 10:43:59,802 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:43:59,802 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:43:59,803 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:59,803 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 116 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:43:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:43:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 10:43:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:43:59,804 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2024-09-25 10:43:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:59,804 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:43:59,804 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-25 10:43:59,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:43:59,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:43:59,806 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:43:59,820 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 10:44:00,010 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:00,014 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:00,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:44:01,470 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:44:01,486 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:01,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:01,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:01,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:01,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:01,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:01,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:01,488 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:01,488 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= ~counter~0 0) (= |old(~counter~0)| 0)) Eliminated clause: (= ~counter~0 0) [2024-09-25 10:44:01,489 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:01,489 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:01,489 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:01,489 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:01,489 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:01,489 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:01,489 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:01,489 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:01,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:01,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:01,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:01,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:01,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:01,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:01,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:01,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:01,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:44:01 BoogieIcfgContainer [2024-09-25 10:44:01,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:44:01,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:44:01,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:44:01,491 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:44:01,491 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:43:54" (3/4) ... [2024-09-25 10:44:01,492 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:44:01,529 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:44:01,529 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:44:01,529 INFO L158 Benchmark]: Toolchain (without parser) took 7362.07ms. Allocated memory was 71.3MB in the beginning and 174.1MB in the end (delta: 102.8MB). Free memory was 50.7MB in the beginning and 64.0MB in the end (delta: -13.3MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. [2024-09-25 10:44:01,529 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:44:01,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.30ms. Allocated memory is still 71.3MB. Free memory was 50.5MB in the beginning and 38.9MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 10:44:01,530 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.09ms. Allocated memory is still 71.3MB. Free memory was 38.9MB in the beginning and 37.9MB in the end (delta: 968.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:44:01,530 INFO L158 Benchmark]: Boogie Preprocessor took 38.00ms. Allocated memory is still 71.3MB. Free memory was 37.9MB in the beginning and 36.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:44:01,530 INFO L158 Benchmark]: RCFGBuilder took 283.86ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 36.0MB in the beginning and 70.1MB in the end (delta: -34.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-25 10:44:01,530 INFO L158 Benchmark]: TraceAbstraction took 6778.18ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 69.2MB in the beginning and 66.1MB in the end (delta: 3.2MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2024-09-25 10:44:01,530 INFO L158 Benchmark]: Witness Printer took 38.24ms. Allocated memory is still 174.1MB. Free memory was 66.1MB in the beginning and 64.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:44:01,534 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.15ms. Allocated memory is still 71.3MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.30ms. Allocated memory is still 71.3MB. Free memory was 50.5MB in the beginning and 38.9MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.09ms. Allocated memory is still 71.3MB. Free memory was 38.9MB in the beginning and 37.9MB in the end (delta: 968.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.00ms. Allocated memory is still 71.3MB. Free memory was 37.9MB in the beginning and 36.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 283.86ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 36.0MB in the beginning and 70.1MB in the end (delta: -34.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6778.18ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 69.2MB in the beginning and 66.1MB in the end (delta: 3.2MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. * Witness Printer took 38.24ms. Allocated memory is still 174.1MB. Free memory was 66.1MB in the beginning and 64.0MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 5.3s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 1280 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 949 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 968 IncrementalHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 331 mSDtfsCounter, 968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 615 GetRequests, 510 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=9, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 98 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 1741 SizeOfPredicates, 14 NumberOfNonLiveVariables, 817 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 905/967 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: (((((1 <= r) && (((((__int128) q * y) + r) + ((__int128) a * y)) == ((__int128) b + x))) && (\old(counter) == 0)) && (1 <= y)) && (b == ((__int128) a * y))) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((((__int128) q * y) + r) + ((__int128) a * y)) == ((__int128) b + x)) && (\old(counter) == 0)) && (1 <= y)) && (b == ((__int128) a * y))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (((cond != 0) && (counter == \old(counter))) && (counter == 0)) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: ((cond != 0) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:44:01,546 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE