./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 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/divbin_unwindbound2.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab65f956ab163b80526b0084797effd91e1aac547effeb9a1fdab821fa279e8e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 23:30:08,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:30:08,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:30:08,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:30:08,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:30:08,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:30:08,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:30:08,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:30:08,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:30:08,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:30:08,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:30:08,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:30:08,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:30:08,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:30:08,793 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:30:08,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:30:08,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:30:08,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:30:08,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:30:08,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:30:08,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:30:08,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:30:08,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:30:08,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:30:08,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:30:08,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:30:08,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:30:08,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:30:08,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:30:08,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:30:08,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:30:08,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:30:08,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:30:08,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:30:08,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:30:08,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:30:08,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:30:08,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:30:08,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:30:08,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:30:08,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:30:08,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:30:08,803 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 -> ab65f956ab163b80526b0084797effd91e1aac547effeb9a1fdab821fa279e8e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 23:30:09,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:30:09,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:30:09,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:30:09,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:30:09,037 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:30:09,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2024-09-24 23:30:10,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:30:10,466 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:30:10,467 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2024-09-24 23:30:10,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/58c6d186a/1a6a6da3c63c48079aa2488f7ef06488/FLAG492aa3383 [2024-09-24 23:30:10,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/58c6d186a/1a6a6da3c63c48079aa2488f7ef06488 [2024-09-24 23:30:10,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:30:10,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:30:10,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:30:10,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:30:10,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:30:10,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eee712d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10, skipping insertion in model container [2024-09-24 23:30:10,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:30:10,642 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/divbin_unwindbound2.i[950,963] [2024-09-24 23:30:10,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:30:10,677 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:30:10,688 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/divbin_unwindbound2.i[950,963] [2024-09-24 23:30:10,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:30:10,716 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:30:10,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10 WrapperNode [2024-09-24 23:30:10,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:30:10,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:30:10,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:30:10,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:30:10,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,733 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:30:10,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:30:10,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:30:10,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:30:10,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:30:10,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,750 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-24 23:30:10,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:30:10,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:30:10,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:30:10,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:30:10,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (1/1) ... [2024-09-24 23:30:10,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:30:10,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:30:10,791 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-24 23:30:10,794 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-24 23:30:10,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:30:10,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:30:10,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:30:10,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:30:10,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:30:10,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:30:10,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:30:10,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:30:10,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:30:10,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:30:10,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:30:10,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:30:10,877 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:30:10,879 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:30:10,997 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-24 23:30:10,998 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:30:11,011 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:30:11,012 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-24 23:30:11,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:30:11 BoogieIcfgContainer [2024-09-24 23:30:11,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:30:11,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:30:11,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:30:11,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:30:11,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:30:10" (1/3) ... [2024-09-24 23:30:11,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a60ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:30:11, skipping insertion in model container [2024-09-24 23:30:11,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:10" (2/3) ... [2024-09-24 23:30:11,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a60ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:30:11, skipping insertion in model container [2024-09-24 23:30:11,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:30:11" (3/3) ... [2024-09-24 23:30:11,020 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2024-09-24 23:30:11,033 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:30:11,033 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:30:11,070 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:30:11,075 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;@1a84f55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:30:11,075 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:30:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-24 23:30:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-24 23:30:11,083 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:11,084 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:30:11,084 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:11,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1602480078, now seen corresponding path program 1 times [2024-09-24 23:30:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:11,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432076776] [2024-09-24 23:30:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,233 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:30:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:30:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:30:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:30:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432076776] [2024-09-24 23:30:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432076776] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:30:11,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:30:11,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 23:30:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132903766] [2024-09-24 23:30:11,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:30:11,266 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 23:30:11,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:11,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 23:30:11,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 23:30:11,287 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:30:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:11,363 INFO L93 Difference]: Finished difference Result 57 states and 81 transitions. [2024-09-24 23:30:11,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 23:30:11,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-24 23:30:11,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:11,370 INFO L225 Difference]: With dead ends: 57 [2024-09-24 23:30:11,371 INFO L226 Difference]: Without dead ends: 28 [2024-09-24 23:30:11,386 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-24 23:30:11,393 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:11,394 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:30:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-24 23:30:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-09-24 23:30:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-24 23:30:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-09-24 23:30:11,453 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-09-24 23:30:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:11,453 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-09-24 23:30:11,453 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:30:11,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-09-24 23:30:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-24 23:30:11,458 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:11,458 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:30:11,459 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:30:11,459 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:11,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash 610811680, now seen corresponding path program 1 times [2024-09-24 23:30:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:11,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147797294] [2024-09-24 23:30:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:30:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:30:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:30:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:30:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:11,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147797294] [2024-09-24 23:30:11,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147797294] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:30:11,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:30:11,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:30:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377413540] [2024-09-24 23:30:11,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:30:11,662 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:30:11,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:11,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:30:11,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:30:11,664 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:30:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:11,741 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-09-24 23:30:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:30:11,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-24 23:30:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:11,743 INFO L225 Difference]: With dead ends: 41 [2024-09-24 23:30:11,743 INFO L226 Difference]: Without dead ends: 29 [2024-09-24 23:30:11,743 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:30:11,744 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:11,745 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:30:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-24 23:30:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-24 23:30:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-24 23:30:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-09-24 23:30:11,757 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2024-09-24 23:30:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:11,758 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-09-24 23:30:11,758 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:30:11,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-09-24 23:30:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-24 23:30:11,759 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:11,759 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:30:11,759 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 23:30:11,759 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:11,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1424295131, now seen corresponding path program 1 times [2024-09-24 23:30:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:11,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265220616] [2024-09-24 23:30:11,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:30:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,936 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:30:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:30:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:30:11,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265220616] [2024-09-24 23:30:11,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265220616] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:30:11,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:30:11,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-24 23:30:11,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913831994] [2024-09-24 23:30:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:30:11,953 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-24 23:30:11,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:11,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-24 23:30:11,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-24 23:30:11,954 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:30:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:12,047 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-09-24 23:30:12,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:30:12,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-09-24 23:30:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:12,048 INFO L225 Difference]: With dead ends: 40 [2024-09-24 23:30:12,048 INFO L226 Difference]: Without dead ends: 33 [2024-09-24 23:30:12,049 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-24 23:30:12,050 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:12,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 77 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:30:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-24 23:30:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-09-24 23:30:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-24 23:30:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-24 23:30:12,060 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2024-09-24 23:30:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:12,061 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-24 23:30:12,061 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:30:12,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-24 23:30:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-24 23:30:12,062 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:12,062 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:30:12,062 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 23:30:12,063 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:12,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1426082591, now seen corresponding path program 1 times [2024-09-24 23:30:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:12,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024071421] [2024-09-24 23:30:12,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:30:12,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994677352] [2024-09-24 23:30:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:12,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:30:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:30:12,084 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-24 23:30:12,085 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-24 23:30:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-24 23:30:12,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:30:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:30:12,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:30:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024071421] [2024-09-24 23:30:12,205 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:30:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994677352] [2024-09-24 23:30:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994677352] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:30:12,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:30:12,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:30:12,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556099875] [2024-09-24 23:30:12,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:30:12,209 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:30:12,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:12,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:30:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:30:12,210 INFO L87 Difference]: Start difference. First operand 32 states and 39 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), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-24 23:30:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:12,266 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2024-09-24 23:30:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:30:12,266 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), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-24 23:30:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:12,268 INFO L225 Difference]: With dead ends: 44 [2024-09-24 23:30:12,268 INFO L226 Difference]: Without dead ends: 41 [2024-09-24 23:30:12,269 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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-24 23:30:12,269 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:12,273 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:30:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-24 23:30:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-09-24 23:30:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-24 23:30:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-09-24 23:30:12,283 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 25 [2024-09-24 23:30:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:12,285 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-09-24 23:30:12,285 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), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-24 23:30:12,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-09-24 23:30:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-24 23:30:12,286 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:12,286 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-24 23:30:12,298 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-24 23:30:12,486 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:30:12,487 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:12,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:12,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1945714758, now seen corresponding path program 1 times [2024-09-24 23:30:12,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:12,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268157552] [2024-09-24 23:30:12,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:12,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:30:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:30:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:30:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:30:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,715 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-24 23:30:12,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:12,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268157552] [2024-09-24 23:30:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268157552] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:30:12,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:30:12,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 23:30:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116342101] [2024-09-24 23:30:12,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:30:12,718 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 23:30:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:12,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 23:30:12,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 23:30:12,719 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-24 23:30:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:12,795 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-09-24 23:30:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:30:12,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-09-24 23:30:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:12,797 INFO L225 Difference]: With dead ends: 64 [2024-09-24 23:30:12,798 INFO L226 Difference]: Without dead ends: 39 [2024-09-24 23:30:12,798 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:30:12,799 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:12,801 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:30:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-24 23:30:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-24 23:30:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-24 23:30:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-09-24 23:30:12,813 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 34 [2024-09-24 23:30:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:12,814 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-09-24 23:30:12,814 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-24 23:30:12,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-09-24 23:30:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-24 23:30:12,815 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:12,815 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:30:12,816 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-24 23:30:12,816 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:12,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1465893311, now seen corresponding path program 1 times [2024-09-24 23:30:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:12,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445836031] [2024-09-24 23:30:12,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:12,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:30:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,955 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:30:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:30:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:30:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 23:30:12,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445836031] [2024-09-24 23:30:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445836031] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:30:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686965350] [2024-09-24 23:30:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:12,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:30:12,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:30:12,970 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-24 23:30:12,971 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-24 23:30:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:13,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-24 23:30:13,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:30:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-24 23:30:13,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:30:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 23:30:13,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686965350] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:30:13,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:30:13,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-09-24 23:30:13,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364757140] [2024-09-24 23:30:13,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:30:13,131 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 23:30:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:13,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 23:30:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-24 23:30:13,131 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-24 23:30:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:13,183 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2024-09-24 23:30:13,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:30:13,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 36 [2024-09-24 23:30:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:13,184 INFO L225 Difference]: With dead ends: 62 [2024-09-24 23:30:13,185 INFO L226 Difference]: Without dead ends: 41 [2024-09-24 23:30:13,185 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:30:13,185 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:13,186 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 83 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:30:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-24 23:30:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-24 23:30:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-24 23:30:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-09-24 23:30:13,192 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 36 [2024-09-24 23:30:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:13,192 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-09-24 23:30:13,192 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-24 23:30:13,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-09-24 23:30:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-24 23:30:13,193 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:13,193 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:30:13,208 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 23:30:13,393 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-24 23:30:13,394 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:13,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1514871206, now seen corresponding path program 1 times [2024-09-24 23:30:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:13,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952533301] [2024-09-24 23:30:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:13,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:13,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:30:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:13,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:30:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:13,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:30:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:13,499 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-24 23:30:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:30:13,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952533301] [2024-09-24 23:30:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952533301] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:30:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798958880] [2024-09-24 23:30:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:13,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:30:13,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:30:13,504 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-24 23:30:13,505 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-24 23:30:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:13,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-24 23:30:13,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:30:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 23:30:13,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:30:13,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798958880] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:30:13,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:30:13,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2024-09-24 23:30:13,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844751689] [2024-09-24 23:30:13,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:30:13,599 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:30:13,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:13,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:30:13,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:30:13,600 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (6), 3 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-24 23:30:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:13,635 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-09-24 23:30:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:30:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (6), 3 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 37 [2024-09-24 23:30:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:13,636 INFO L225 Difference]: With dead ends: 43 [2024-09-24 23:30:13,636 INFO L226 Difference]: Without dead ends: 0 [2024-09-24 23:30:13,636 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:30:13,636 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:13,637 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:30:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-24 23:30:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-24 23:30:13,637 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-24 23:30:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-24 23:30:13,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2024-09-24 23:30:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:13,637 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-24 23:30:13,637 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (6), 3 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-24 23:30:13,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-24 23:30:13,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-24 23:30:13,642 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-24 23:30:13,657 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-24 23:30:13,847 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-24 23:30:13,853 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:30:13,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-24 23:30:14,194 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-24 23:30:14,209 WARN L155 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-24 23:30:14,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 11:30:14 BoogieIcfgContainer [2024-09-24 23:30:14,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-24 23:30:14,213 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-24 23:30:14,213 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-24 23:30:14,213 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-24 23:30:14,213 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:30:11" (3/4) ... [2024-09-24 23:30:14,215 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-24 23:30:14,258 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-24 23:30:14,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-24 23:30:14,259 INFO L158 Benchmark]: Toolchain (without parser) took 3771.32ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 79.8MB in the beginning and 64.8MB in the end (delta: 15.0MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2024-09-24 23:30:14,259 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 151.0MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 23:30:14,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.65ms. Allocated memory is still 151.0MB. Free memory was 79.6MB in the beginning and 122.8MB in the end (delta: -43.2MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-09-24 23:30:14,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.54ms. Allocated memory is still 151.0MB. Free memory was 122.8MB in the beginning and 122.4MB in the end (delta: 421.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 23:30:14,259 INFO L158 Benchmark]: Boogie Preprocessor took 26.19ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 120.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:30:14,260 INFO L158 Benchmark]: RCFGBuilder took 252.08ms. Allocated memory is still 151.0MB. Free memory was 120.3MB in the beginning and 106.9MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-24 23:30:14,260 INFO L158 Benchmark]: TraceAbstraction took 3196.78ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 106.0MB in the beginning and 66.9MB in the end (delta: 39.1MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2024-09-24 23:30:14,260 INFO L158 Benchmark]: Witness Printer took 45.55ms. Allocated memory is still 207.6MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:30:14,264 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 151.0MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.65ms. Allocated memory is still 151.0MB. Free memory was 79.6MB in the beginning and 122.8MB in the end (delta: -43.2MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.54ms. Allocated memory is still 151.0MB. Free memory was 122.8MB in the beginning and 122.4MB in the end (delta: 421.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.19ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 120.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 252.08ms. Allocated memory is still 151.0MB. Free memory was 120.3MB in the beginning and 106.9MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3196.78ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 106.0MB in the beginning and 66.9MB in the end (delta: 39.1MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. * Witness Printer took 45.55ms. Allocated memory is still 207.6MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 143 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 177 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 600 SizeOfPredicates, 6 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 68/76 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: 36]: Loop Invariant Derived loop invariant: ((\old(counter) == 0) && (((((2 <= counter) && (A == r)) && (q == 0)) || ((((A == r) && (counter == 0)) && (B == b)) && (q == 0))) || (((A == r) && (q == 0)) && (counter == 1)))) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((2 <= counter) && (A == r)) && (q == 0)) || (((A == r) && (B == b)) && (q == 0))) && (\old(counter) == 0)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (counter == 0) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-09-24 23:30:14,284 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